Finding length-3 positive Cunningham chains and their cryptographic significance

DOI10.1007/BFB0054869MaRDI QIDQ3840171zbMATH OpenFDO

Authors Adam L. Young, Moti Yung

Publication date 1998

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

Auto-Recoverable and Auto-Certifiable CryptosystemCunningham ChainsElGamal systemPrimality testingPublic-Key Cryptosystems

Mathematics Subject Classification ID

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

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)

• The Bateman-Horn conjecture: heuristic, history, and applications
• A note on Shanks's chains of primes
• Long Chains of Nearly Doubled Primes
• The largest known Cunningham chain of length 3 of the first kind
• Sieving for large Cunningham chains of length 3 of the first kind
• Polynomial Cunningham chains
• A study of Cunningham bounds through rogue primes

Describes a project that uses

Uses Software

• CryptoLib

This page was built for publication: Finding length-3 positive Cunningham chains and their cryptographic significance

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