Cryptanalysis of RSA for a special case with \(d > e\)

DOI10.1007/s11432-009-0014-zzbMath1181.94101OpenAlexW2068942287MaRDI QIDQ2267091

Haijian Zhou, Ping Luo, Yiqi Dai, Dao-Shun Wang

Publication date: 26 February 2010

Published in: Science in China. Series F (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11432-009-0014-z

zbMATH Keywords

RSAcryptanalysisLLL algorithmlattice basis reduction

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (2)

Comment on ``An enhanced and secured RSA public cryptosystem algorithm using Chinese remainder theorem (ESRPKC) ⋮ Forty years of attacks on the RSA cryptosystem: A brief survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Factoring polynomials with rational coefficients
• Small solutions to polynomial equations, and low exponent RSA vulnerabilities
• Cryptanalysis of short RSA secret exponents
• Solving Simultaneous Modular Equations of Low Degree
• A method for obtaining digital signatures and public-key cryptosystems
• Cryptanalysis of RSA with Private Key d Less than N 0.292
• Floating-Point LLL Revisited

This page was built for publication: Cryptanalysis of RSA for a special case with \(d > e\)