Provable prime
id:
provable-prime-263-11877911
title:
Provable prime
text:
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. Contrast with probable prime, which is likely 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 gu
brand slug:
wiki
category slug:
encyclopedia
description:
Prime integer calculated using a primality-proving algorithm
original url:
https://en.wikipedia.org/wiki/Provable_prime
date created:
date modified:
2023-06-14T18:13:34Z
main entity:
{"identifier":"Q7252277","url":"https://www.wikidata.org/entity/Q7252277"}
image:
fields total:
13
integrity:
14