Cryptanalysis of large RSA exponent by using the LLL algorithm

DOI10.1016/j.amc.2004.10.082zbMath1078.94012OpenAlexW1984980833MaRDI QIDQ2572356

David C. Yen, Chien-Yuan Chen, Cheng-Yuan Ku

Publication date: 16 November 2005

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2004.10.082

zbMATH Keywords

LLL algorithmCryptanalysisRSA systemPublic key encryptionRSA exponent

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Unnamed Item
• Factoring polynomials with rational coefficients
• Cryptanalysis of `less short' RSA secret exponents
• Cryptanalysis of short RSA secret exponents
• A method for obtaining digital signatures and public-key cryptosystems
• Cryptanalysis of RSA with private key d less than N/sup 0.292/

This page was built for publication: Cryptanalysis of large RSA exponent by using the LLL algorithm