next up previous
Next: 3.2.11 How do you Up: 3.2 RSA Previous: 3.2.9 How does one

3.2.10 What if users of RSA run out of distinct primes?

There are enough prime numbers that RSA users will never run out of them. For example, the number of primes of length 512 bits or less exceeds 10150, according to the prime number theorem; this is more than the number of atoms in the known universe.

Denis Arnaud