Analyzing Standards for RSA Integers

DOI10.1007/978-3-642-21969-6_16MaRDI QIDQ3011917zbMATH OpenOpenAlexFDO

Authors Daniel Loebenberger, Michael Nüsken

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

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

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 1845044
• scientific article; zbMATH DE number 7002751
• Notions for RSA integers
• Cryptanalysis of RSA Using the Ratio of the Primes
• Counting RSA-integers
• Further cryptanalysis of a type of RSA variants
• How to generalize RSA cryptanalyses
• Security analysis of RSA-BSSA
• Cryptanalysis of RSA and its variants.
• Implications of the arithmetic ratio of prime numbers for RSA security

Cites work

• A method for obtaining digital signatures and public-key cryptosystems
• Analyzing Standards for RSA Integers
• Counting RSA-integers
• Fast generation of prime numbers and secure public-key cryptographic parameters.
• Fast Generation of Prime Numbers on Portable Devices: An Update
• Foundations of Cryptography
• scientific article; zbMATH DE number 708818 (Why is no real title available?)
• scientific article; zbMATH DE number 3303655 (Why is no real title available?)

Cited in

(3)

• Analyzing Standards for RSA Integers
• Notions for RSA integers
• Counting RSA-integers

Describes a project that uses

Uses Software

• GnuPG
• GNU Crypto

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

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