A unified method for private exponent attacks on RSA using lattices

DOI10.1142/S0129054120500045MaRDI QIDQ5859736zbMATH OpenOpenAlexFDO

Authors Hatem M. Bahig, Dieaa I. Nassr, Ashraf M. Bhery, Abderrahmane Nitaj

Publication date 20 April 2021

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129054120500045

zbMATH Keywords

RSAcryptanalysisCoppersmith's methodLLL algorithmlattice basis reductionmulti-prime RSAprivate exponent attack

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 1852133
• CRYPTANALYSIS OF RSA WITH CONSTRAINED KEYS
• A Partial Key Exposure Attack on RSA Using a 2-Dimensional Lattice
• Cryptanalysis of RSA with multiple small secret exponents
• A New Attack on RSA and CRT-RSA

Cites work

• scientific article; zbMATH DE number 1182510 (Why is no real title available?)
• scientific article; zbMATH DE number 1951624 (Why is no real title available?)
• A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants
• A method for obtaining digital signatures and public-key cryptosystems
• Another Generalization of Wiener’s Attack on RSA
• Attacks on multi-prime RSA with small prime difference
• Cryptanalysis of RSA with private key d less than N/sup 0.292/
• Cryptanalysis of RSA with small prime difference
• Cryptanalysis of Short Exponent RSA with Primes Sharing Least Significant Bits
• Cryptanalysis of multi-prime RSA with small prime difference
• Cryptanalysis of short RSA secret exponents
• Factoring polynomials with rational coefficients
• General bounds for small inverse problems and its applications to multi-prime RSA
• Maximizing small root bounds by linearization and applications to small secret exponent RSA
• New Attacks on the RSA Cryptosystem
• On the security of RSA with primes sharing least-significant bits
• Revisiting Wiener’s Attack – New Weak Keys in RSA
• Small solutions to polynomial equations, and low exponent RSA vulnerabilities

Cited in

(6)

• A new method of constructing a lattice basis and its applications to cryptanalyse short exponent RSA
• Lattice-based weak-key analysis on single-server outsourcing protocols of modular exponentiations and basic countermeasures
• Performance analysis of NTRU algorithm with non-post-quantum algorithms
• Improving small private exponent attack on the Murru-Saettone cryptosystem
• A New Lattice Construction for Partial Key Exposure Attack for RSA
• Practical attacks on small private exponent RSA: new records and new insights

This page was built for publication: A unified method for private exponent attacks on RSA using lattices

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