ABSTRACT
The primes p and q used in public key cryptography must be large, as the method is insecure if an attacker is able to factor their product. Fortunately, plenty of large primes exist. It has been known since the time of Euclid that there are infinitely many primes, and therefore infinitely many larger than any given size. Euclid’s proof follows.
