Public keys

DOI10.1007/978-3-642-32009-5_37MaRDI QIDQ2914292zbMATH OpenOpenAlexFDO

Authors Arjen K. Lenstra, James P. Hughes, Maxime Augier, Joppe W. Bos, Thorsten Kleinjung, Christophe Wachter

Publication date 25 September 2012

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

Full work available at URL https://doi.org/10.1007/978-3-642-32009-5_37

zbMATH Keywords

(batch) factoringdiscrete logarithmEuclidean algorithmpublic keyssanity checkseeding random number generators

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 2085443
• The Complexity of Public-Key Cryptography
• scientific article; zbMATH DE number 1588487
• scientific article; zbMATH DE number 4168393
• scientific article; zbMATH DE number 1030995

Cited in

(13)

• On the impossibility of cryptography with tamperable randomness
• How to eat your entropy and have it too: optimal recovery strategies for compromised RNGs
• Cryptographic reverse firewalls for interactive proof systems
• Strengthening the security of authenticated key exchange against bad randomness
• Public-key generation with verifiable randomness
• Message transmission with reverse firewalls -- secure communication on corrupted machines
• Backdoors in pseudorandom number generators: possibility and impossibility results
• Security Against Related Randomness Attacks via Reconstructive Extractors
• scientific article; zbMATH DE number 4055525 (Why is no real title available?)
• scientific article; zbMATH DE number 1996486 (Why is no real title available?)
• VSS Made Simpler
• Cryptographic reverse firewalls for interactive proof systems
• The random oracle model: a twenty-year retrospective

This page was built for publication: Public keys

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