The better bound of private key in RSA with unbalanced primes
From MaRDI portal
Publication:1406195
DOI10.1016/S0096-3003(02)00198-4zbMath1026.94008MaRDI QIDQ1406195
Ho-Kyu Lee, Hyun-Soo Hong, Hyang-Sook Lee, Hee Jung Lee
Publication date: 9 September 2003
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
lattice reductionCoppersmith's techniquegeometrically progressive matricesmultivariate modular equationsRSA attack
Uses Software
Cites Work
- Factoring polynomials with rational coefficients
- Cryptanalysis of `less short' RSA secret exponents
- Small solutions to polynomial equations, and low exponent RSA vulnerabilities
- Cryptanalysis of short RSA secret exponents
- Cryptanalysis of RSA with Private Key d Less than N 0.292
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The better bound of private key in RSA with unbalanced primes