Definition[]
A provable prime is an integer that is either constructed to be prime or is calculated to be prime using a primality-proving algorithm.
Source[]
- Digital Signature Standard (DSS) 4 (FIPS 186-3) (June 2009).
34,539
pages
A provable prime is an integer that is either constructed to be prime or is calculated to be prime using a primality-proving algorithm.