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:
“In looking back over the college careers of those who for various reasons have been prominent in undergraduate life ... one cannot help noticing that these men have nearly always shown from the start an interest in the lives of their fellow students. A large acquaintance means that many persons are dependent on a man and conversely that he himself is dependent on many. Success necessarily means larger responsibilities, and responsibilities mean many friends.”
—Franklin D. Roosevelt (1882–1945)