Admin: Created page with "'''Industrial-grade primes''' (the term is apparently due to Henri Cohen) are integers for which primality has not been certified (i...."

2019-03-22T03:52:31Z

Created page with "'''Industrial-grade primes''' (the term is apparently due to Henri Cohen) are integers for which primality has not been certified (i...."

New page

'''Industrial-grade primes''' (the term is apparently due to [[Henri Cohen (number theorist)|Henri Cohen]]) are [[integer]]s for which [[primality]] has not been certified (i.e. rigorously proven), but they have undergone [[probable prime]] tests such as the [[Miller-Rabin primality test]], which has a positive, but negligible, failure rate, or the [[Baillie-PSW primality test]], which no composites are known to pass.

Industrial-grade primes are sometimes used instead of certified primes in [[algorithms]] such as [[RSA encryption]], which require the user to generate large [[prime numbers]]. [[Primality test|Certifying the primality]] of large numbers (over 100 digits for instance) is significantly harder than showing they are industrial-grade primes. The latter can be done almost instantly with a [[failure rate]] so low that it is highly unlikely to ever fail in practice. In other words, the number is believed to be prime with very high, but not absolute, confidence.

==Source==

[http://wikipedia.org/ http://wikipedia.org/]
[[Category:Cryptographic algorithms]]
[[Category:Cryptography]]

Industrial-grade prime - Revision history

Admin: Created page with "'''Industrial-grade primes''' (the term is apparently due to Henri Cohen) are integers for which primality has not been certified (i...."