6.3 Why is cryptography secure? || Adam Gibson

Adam Gibson explains that prime numbers logarithmically decrease in density, but the distribution of prime numbers is in fact random, which makes them really difficult to find. Without computers, there’s not really a use case for such unfadementally large random numbers, but thanks to fast computation, cryptography becomes possible.