Cryptanalysis of large RSA exponent by using the LLL algorithm

DOI10.1016/J.AMC.2004.10.082MaRDI QIDQ2572356zbMATH OpenOpenAlexFDO

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

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

CryptanalysisLLL algorithmPublic key encryptionRSA exponentRSA system

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Large decryption exponents in RSA
• Cryptanalysis of `less short' RSA secret exponents
• Lattice-based cryptanalysis of RSA cryptosystem
• Cryptanalysis of RSA with more than one decryption exponent
• Cryptanalysis of an RSA variant with moduli \(N=p^r q^l\)
• Cryptanalysis of short RSA secret exponents
• Cryptanalysis of RSA with two decryption exponents
• Cryptanalysis of Short Exponent RSA with Primes Sharing Least Significant Bits

Cites work

• A method for obtaining digital signatures and public-key cryptosystems
• 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
• Factoring polynomials with rational coefficients
• On finding small solutions of modular multivariate polynomial equations

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

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