Jump to content

Provable prime

From Wikipedia, the free encyclopedia

In number theory, a provable prime is an integer that has been calculated to be prime using a primality-proving algorithm. Boot-strapping techniques using Pocklington primality test are the most common ways to generate provable primes for cryptography.[1][2] Contrast with probable prime, which is likely (but not certain) to be prime, based on the output of a probabilistic primality test.

In principle, every prime number can be proved to be prime in polynomial time by using the AKS primality test. Other methods which guarantee that their result is prime, but which do not work for all primes, are useful for the random generation of provable primes.[3]

Provable primes have also been generated on embedded devices.[4]

See also[edit]


  1. ^ C. Couvreur and J. J. Quisquater (1982), An Introduction to Fast Generation of Large Prime Numbers, Philips Journal of Research, vol. 37, pp. 231–264
  2. ^ Crandall, Richard; Pomerance, Carl (2005). Prime Numbers: A Computational Perspective. Springer. pp. 174–178. ISBN 978-0387-25282-7.
  3. ^ Mollin, Richard A. (2002), RSA and Public-Key Cryptography, Discrete Mathematics and Its Applications, CRC Press, pp. 124–125, ISBN 9781420035247.
  4. ^ Christophe, Clavier. "Generating Provable Primes Efficiently on Embedded Devices" (PDF). The International Association for Cryptologic Research.