Large Primes
For the large primes used in cryptography, it is usual to use a modified form of sieving: a randomly-chosen range of odd numbers of the desired size is sieved against a number of relatively small odd primes (typically all primes less than 65,000). The remaining candidate primes are tested in random order with a standard primality test such as the Miller-Rabin primality test for probable primes.
Alternatively, a number of techniques exist for efficiently generating provable primes. These include generating prime numbers p for which the prime factorization of p − 1 or p + 1 is known.
Read more about this topic: Generating Primes
Famous quotes containing the word large:
“[T]here is no Part of the World where Servants have those Privileges and Advantages as in England: They have no where else such plentiful Diet, large Wages, or indulgent Liberty: There is no place wherein they labour less, and yet where they are so little respectful, more wasteful, more negligent, or where they so frequently change their Masters.”
—Richard Steele (1672–1729)