Cryptanalysis of RSA with private key d less than N0.292

IEEE Transactions on Information Theory

Volumn 46, Issue 4, 2000, Pages 1339-1349

  Boneh, Dan ^a   Durfee, Glenn ^a  

^a Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOUNDARY CONDITIONS; DECODING; HEURISTIC METHODS; INTEGER PROGRAMMING; INVERSE PROBLEMS; POLYNOMIALS; SECURITY OF DATA; VECTORS;

CRYPTANALYSIS; LATTICE BASIS REDUCTION; LOW EXPONENT; RIVEST-SHAMIR-ADLEMAN SYSTEM;

CRYPTOGRAPHY;

EID: 0034226114     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.850673     Document Type: Article

References (14)

1. D. Bleichenbacher, On the security of the KMOV public key cryptosystem, in Crypto'97, Lecture Notes in Computer Science. Berlin, Germay: Springer-Verlag, 1997, vol. 1294, pp. 235-248.
2. 0.292, in Eurocrypt'99, Lecture Notes in Computer Science. Berlin, Germany: Springer-Verlag, 1999, vol. 1592, pp. 1-11.
3. D. Coppersmith, Small solutions to polynomial equations, and low exponent RSA vulnerabilities, J. Cryptol.. vol. 10, pp. 233-260, 1997.
4. 3. Håstad, Solving simultaneous modular equations of low degree, SIAM J. Computing, vol. 17, no. 2, pp. 336-341, 1988.
5. N. Howgrave-Graham, Finding small roots of univariate modular equations revisited, in Cryptography and Coding, Lecture Notes in Computer Science. Berlin, Germay: Springer-Verlag, 1997, vol. 1355, pp. 131-142.
6. A. Joux and J. Stern, Lattice reductions: A toolbox for the cryptanalyst, J. Cryptol., vol. 11, no. 3, pp. 161-185, 1998.
7. C. Jutla, On finding small solutions of modular multivariate polynomial equations, in Eurocrypt'98, Lecture Notes in Computer Science. Berlin, Germany: Springer-Verlag, 1998, vol. 1403, pp. 158-170.
8. A. Lenstra, H. Lenstra, and L. Lovász, Factoring polynomials with rational coefficients, Math. Annalen, vol. 261, pp. 515-534, 1982.
9. L. Lovász, An algorithmic theory of numbers, graphs, and convexity, in SI AM CBMS-NSF Regional Conf. Series in Applied Mathematics, vol. 50, 1986.
10. R. Rivest, A. Shamir, and L. Adleman, A method for obtaining digital signatures and public-key cryptosystems, Commun. ACM, vol. 21, no. 2, pp. 120-126, 1978.
11. A. Shamir, RSA for paranoids, RSA Lab. CryptoBytes, vol. 1, no. 3, pp. 1-1, 1995.
12. Number Theory Library (NTL), V Shoup. [Online]. Available: http://www. shoup.net/ntl/
13. E. Verheul and H. van Tilborg, Cryptanalysis of less short RSA secret exponents, Applicable Alg. Eng., Commun., Computing, vol. 8, pp. 425-435, 1997.
14. M. Wiener, Cryptanalysis of short RSA secret exponents, IEEE Trans. Inform. Theory, vol. 36, pp. 553-558, May 1990.