Large decryption exponents in RSA

DOI10.1016/S0893-9659(03)80046-0MaRDI QIDQ1431928zbMATH OpenOpenAlexFDO

Authors D. Massart

Publication date 11 June 2004

Published in Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0893-9659(03)80046-0, http://hdl.handle.net/10261/21264

zbMATH Keywords

Decryption exponentPublic key cryptographyRSA cryptosystem

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Cryptanalysis of RSA with more than one decryption exponent
• Cryptanalysis of RSA with two decryption exponents
• On the uniformity of distribution of the decryption exponent in fixed encryption exponent RSA
• Partial Key Exposure Attacks on RSA up to Full Size Exponents
• A new vulnerable class of exponents in RSA

Cites work

• An attack on RSA given a small fraction of the private key bits
• Cryptanalysis of `less short' RSA secret exponents
• Cryptanalysis of RSA with private key d less than N/sup 0.292/
• Cryptanalysis of short RSA secret exponents
• Cryptanalysis of the RSA schemes with short secret exponent from Asiacrypt '99
• scientific article; zbMATH DE number 4035724 (Why is no real title available?)
• scientific article; zbMATH DE number 1258344 (Why is no real title available?)
• scientific article; zbMATH DE number 954401 (Why is no real title available?)
• Low-exponent RSA with related messages

Cited in

(5)

• Fixed points of the RSA encryption algorithm
• How to decrypt or even substitute DES-encrypted messages in \(2^{28}\) steps.
• Cryptanalysis of large RSA exponent by using the LLL algorithm
• An application of Euclidean algorithm in cryptanalysis of RSA
• On the uniformity of distribution of the decryption exponent in fixed encryption exponent RSA

This page was built for publication: Large decryption exponents in RSA

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