FANDOM


Definition Edit

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 Edit

  • Digital Signature Standard (DSS) 4 (FIPS 186-3) (June 2009).

Ad blocker interference detected!


Wikia is a free-to-use site that makes money from advertising. We have a modified experience for viewers using ad blockers

Wikia is not accessible if you’ve made further modifications. Remove the custom ad blocker rule(s) and the page will load as expected.