A Unified Method for Private Exponent Attacks on RSA Using Lattices
From MaRDI portal
Publication:5859736
DOI10.1142/S0129054120500045zbMath1461.94073OpenAlexW3011125593MaRDI QIDQ5859736
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
RSAcryptanalysisLLL algorithmCoppersmith's methodlattice basis reductionmulti-prime RSAprivate exponent attack
Related Items (2)
Performance analysis of NTRU algorithm with non-post-quantum algorithms ⋮ Improving small private exponent attack on the Murru-Saettone cryptosystem
Cites Work
- Unnamed Item
- Unnamed Item
- Factoring polynomials with rational coefficients
- Small solutions to polynomial equations, and low exponent RSA vulnerabilities
- Cryptanalysis of RSA with small prime difference
- On the security of RSA with primes sharing least-significant bits
- General Bounds for Small Inverse Problems and Its Applications to Multi-Prime RSA
- Cryptanalysis of short RSA secret exponents
- Another Generalization of Wiener’s Attack on RSA
- Revisiting Wiener’s Attack – New Weak Keys in RSA
- Maximizing Small Root Bounds by Linearization and Applications to Small Secret Exponent RSA
- A method for obtaining digital signatures and public-key cryptosystems
- Cryptanalysis of RSA with private key d less than N/sup 0.292/
- Cryptanalysis of Multi-Prime RSA with Small Prime Difference
- New Attacks on the RSA Cryptosystem
- Attacks on Multi-Prime RSA with Small Prime Difference
- A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants
- Cryptanalysis of Short Exponent RSA with Primes Sharing Least Significant Bits
This page was built for publication: A Unified Method for Private Exponent Attacks on RSA Using Lattices
