Approximate integer common divisors

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2146, Issue , 2001, Pages 51-66

  Howgrave Graham, Nick ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Approximations; Continued fractions; Coppersmith s method; Greatest common divisor; Lattice attacks

Indexed keywords

CRYPTOGRAPHY; POLYNOMIAL APPROXIMATION;

APPROXIMATIONS; CONTINUED FRACTION; GREATEST COMMON DIVISORS; LATTICE ATTACKS; S-METHOD;

LATTICE THEORY;

EID: 84958958450     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44670-2_6     Document Type: Conference Paper

References (15)

1. D. Coppersmith. Finding a small root of a bivariate integer equation. Proc. Of Eurocrypt’96 Lecture Notes in Computer Science, Vol. 1233, Springer-Verlag, 1996
2. D. Boneh. Twenty years of attacks on the RSA cryptosystem. Notices of the American Mathematical Society (AMS)Vol. 46, No. 2, pp. 203-213, 1999.
3. D. Boneh and G. Durfee. Cryptanalysis of RSA with private key d less than N0.292. IEEE Transactions on Information Theory, Vol 46, No. 4, pp. 1339-1349, July 2000.
4. D. Boneh, G. Durfee and Y. Frankel. An attack on RSA given a small fraction of the private key bits. In proceedings AsiaCrypt’98, Lecture Notes in Computer Science, Vol. 1514, Springer-Verlag, pp. 25-34, 1998.
5. D. Boneh, G. Durfee and N. Howgrave-Graham. Factoring N = prq for large r. In Proceedings Crypto’99, Lecture Notes in Computer Science, Vol. 1666, Springer-Verlag, pp. 326-337, 1999.
6. G.H. Hardy and E.M. Wright. An introduction to the theory of numbers, 5’th edition. Oxford University press, 1979.
7. N.A. Howgrave-Graham. Computational mathematics inspired by RSA. Ph.D Thesis, Bath University, 1999.
8. A.K. Lenstra, H.W. Lenstra and L. Lovász. Factoring polynomials with integer coefficients. Mathematische Annalen, Vol. 261, pp. 513-534, 1982.
9. K.L. Manders and L.M. Adleman. NP-Complete decision problems for binary quadratics. JCSSVol. 16(2), pp. 168-184, 1978.
10. P. Nguyen and J. Stern. Lattice reduction in cryptology: An update”, Algorithmic Number Theory – Proc. of ANTS-IV, volume 1838 of LNCS. Springer-Verlag, 2000.
11. T. Okamoto. Fast public–key cryptosystem using congruent polynomial equations Electronic letters, Vol. 22, No. 11, pp. 581-582, 1986.
12. C–P. Schnorr. A hierarchy of polynomial time lattice bases reduction algorithms Theoretical computer science, Vol. 53, pp. 201-224, 1987.
13. V. Shoup. NTL: A Library for doing Number Theory (version 4.2) http://www.shoup.net
14. B. Vallée, M. Girault and P. Toffin. Proceedings of Eurocrypt’88 LNCS vol. 330, pp. 281-291, 1988.
15. M. Wiener. Cryptanalysis of short RSA secret exponents IEEE Transactions of Information Theoryvolume 36, pages 553-558, 1990.