On the security of RSA with primes sharing least-significant bits

DOI10.1007/s00200-004-0164-6zbMath1065.94008OpenAlexW2062099180MaRDI QIDQ1762562

Yuliang Zheng, Ron Steinfeld

Publication date: 9 February 2005

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00200-004-0164-6

zbMATH Keywords

cryptanalysispartial key exposureRSA cryptosystemBoneh-Durfee-Frankel attackcommunications securityCoppersmith algorithmleast-significant bitsserver-aided signature generation

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)

Related Items

Factoring multi-power RSA moduli with primes sharing least or most significant bits ⋮ Factoring RSA moduli with primes sharing bits in the middle ⋮ A new attack on some RSA variants ⋮ On the Improvement of the BDF Attack on LSBS-RSA ⋮ Using LLL-Reduction for Solving RSA and Factorization Problems ⋮ Cryptanalysis of Short Exponent RSA with Primes Sharing Least Significant Bits ⋮ A Unified Method for Private Exponent Attacks on RSA Using Lattices ⋮ Forty years of attacks on the RSA cryptosystem: A brief survey

Cites Work

• Small solutions to polynomial equations, and low exponent RSA vulnerabilities
• Cryptanalysis of RSA with small prime difference
• The Exact Security of Digital Signatures-How to Sign with RSA and Rabin
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• A method for obtaining digital signatures and public-key cryptosystems
• Advances in Cryptology - CRYPTO 2003
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item