Very Short Primality Proofs

DOI10.2307/2007892MaRDI QIDQ3748327zbMATH OpenOpenAlexFDO

Authors Carl Pomerance

Publication date 1987

Full work available at URL https://doi.org/10.2307/2007892

zbMATH Keywords

computational number theoryfactorizationprimality tests

Mathematics Subject Classification ID

Primality (11Y11) Number-theoretic algorithms; complexity (11Y16) Analysis of algorithms and problem complexity (68Q25)

Cited in

(6)

• A framework for deterministic primality proving using elliptic curves with complex multiplication
• Elliptic Curves and Primality Proving
• Infinite Sets of Primes with Fast Primality Tests and Quick Generation of Large Primes
• The Lucas-Pratt primality tree
• Prime chains and Pratt trees
• Kummer surface arithmetic for primality testing

This page was built for publication: Very Short Primality Proofs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3748327)