There are enough prime numbers that RSA users will never run out of
them. The Prime Number Theorem states that the number of primes less than
or equal to n is asymptotically n/log n. This means
that the number of prime numbers of length 512 bits or less is about 10150,
which is a number greater than the number of atoms in the known universe.
| Question 15 |
| Back to FAQ INDEX |
|RSA
Labs' FAQ Home | RSA Home |
What's New?
|
| RSA & Partner Products
|
FTP Server | About
... |
| Contact Sales |
Contact Technical Support |
Contact RSA Laboratories:
100 Marine Parkway, Suite 500
Redwood City, CA
94065-1031
phone: 415-595-8782
fax: 415-595-1873
Website: http://www.rsa.com/rsalabs/
Website feedback or comments can be sent
to : WEBMAVEN@RSA.COM
Copyright ©1996, RSA Laboratories, Inc. All Rights
Reserved.
Last Updated: Friday, May 24, 1996