scientific article; zbMATH DE number 1186949

MaRDI QIDQ3840171zbMATH OpenFDO

Authors Adam L. Young, Moti Yung

Publication date 1998

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/1423/14230289.htm

zbMATH Keywords

ElGamal systemPrimality testingAuto-Recoverable and Auto-Certifiable CryptosystemCunningham ChainsPublic-Key Cryptosystems

Mathematics Subject Classification ID

Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)

Recommendations

• The largest known Cunningham chain of length 3 of the first kind
• Sieving for large Cunningham chains of length 3 of the first kind
• Sieving for large twin primes and Cunningham chains of length 2 of the second kind
• Prime clusters and Cunningham chains

Cited in

(7)

• scientific article; zbMATH DE number 1643954 (Why is no real title available?)
• Polynomial Cunningham chains
• The largest known Cunningham chain of length 3 of the first kind
• The Bateman-Horn conjecture: heuristic, history, and applications
• A study of Cunningham bounds through rogue primes
• Long Chains of Nearly Doubled Primes
• Sieving for large Cunningham chains of length 3 of the first kind

Describes a project that uses

Uses Software

• CryptoLib

This page was built for publication:

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