Analyzing Standards for RSA Integers

DOI10.1007/978-3-642-21969-6_16zbMath1280.94079OpenAlexW1662296446MaRDI QIDQ3011917

Michael Nüsken, Daniel Loebenberger

Publication date: 29 June 2011

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-21969-6_16

zbMATH Keywords

reductionANSI X9.44FIPS 186-3IEEE 1363-2000ISO/IEC 18033-2NESSIEoutput entropyPKCS{\#}1RSA integer

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (1)

Analyzing Standards for RSA Integers

Uses Software

• GnuPG
• GNU Crypto

Cites Work

• Unnamed Item
• Unnamed Item
• Counting RSA-integers
• Fast generation of prime numbers and secure public-key cryptographic parameters.
• Analyzing Standards for RSA Integers
• Fast Generation of Prime Numbers on Portable Devices: An Update
• A method for obtaining digital signatures and public-key cryptosystems
• Foundations of Cryptography

This page was built for publication: Analyzing Standards for RSA Integers