Factoring N = prq for large r

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

Volumn 1666, Issue , 1999, Pages 326-337

  Boneh, Dan ^a   Durfee, Glenn ^a   Howgrave Graham, Nick ^b  

^a Stanford University   (United States)

^b UNIVERSITY OF BATH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL APPROXIMATION;

CRYPTOGRAPHIC APPLICATIONS; ELLIPTIC CURVE; FACTORING INTEGERS; POLYNOMIAL-TIME;

CRYPTOGRAPHY;

EID: 84957045680     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48405-1_21     Document Type: Conference Paper

References (19)

1. D. Coppersmith, “Modications to the number eld sieve”, J. of Cryptology, Vol. 6, pp. 169-180, 1993.
2. D. Coppersmith, “Small solutions to polynomial equations, and low exponent RSA vulnerabilities”, J. of Cryptology, Vol. 10, pp. 233-260, 1997.
3. A. Fujioke, T. Okamoto, S. Miyaguchi, “ESIGN: an ecient digital signature implementation for smartcards”, In. proc. Eurocrypt '91, pp. 446-457, 1991.
4. J. Hastad, ”Solving simultaneous modular equations of low degree”, SIAM J. of Computing, Vol. 17, No. 2, pp. 336-341, 1988.
5. N. Howgrave-Graham, “Finding small roots of univariate modular equations revisited”, Proc. of Cryptography and Coding, LNCS 1355, Springer-Verlag, 1997, pp. 131-142.
6. N. Howgrave-Graham, “Extending LLL to Gaussian integers”, Unpublished Manuscript, March 1998. http://www.bath.ac.uk/~mapnahg/pub/gauss.ps
7. A. Lenstra, H.W. Lenstra Jr., “Algorithms in Number Theory”, in Handbook of Theoretical Computer Science (Volume A: Algorithms and Complexity), ch. 12, pp. 673-715, 1990.
8. A. Lenstra, H.W. Lenstra Jr., “The development of the number eld sieve”, Lecture Notes in Mathematics, Vol. 1554, Springer-Verlag, 1994.
9. A. Lenstra, H.W. Lenstra Jr., and L. Lovasz, ”Factoring polynomial with rational coecients”, Mathematiche Annalen, 261:515-534, 1982.
10. H.W. Lenstra Jr., “Factoring integers with elliptic curves”, Annuals of Mathematics, 126:649-673, 1987.
11. L. Lovasz, “An algorithmic theory of numbers, graphs and convexity”, SIAM lecture series, Vol. 50, 1986.
12. T. Okamoto, S. Uchiyama, “A new public key cryptosystem as secure as factoring”, in Proc. Eurocrypt '98, pp. 310-318, 1998.
13. R. Peralta, T. Okamoto, “Faster factoring of integers of special form”, IEICE Trans. Fundamentals, Vol. E79-A, No. 4, pp. 489-493, 1996.
14. J.J. Quisquater and C. Couvreur, “Fast deciperhment algorithm for RSA public-key cryptosystem”, Electronic Letters, 18(21), pp. 905-907, 1982.
15. R. Silverman, Wagsta Jr., “A Practical analysis of the elliptic curve factoring algorithm”, Math. Comp. Vol 61, 1993.
16. A. Shamir, “RSA for Paranoids”, RSA Laboratories' CryptoBytes, vol. 1, no. 3, pp. 4, 1995.
17. V. Shoup, Number Theory Library (NTL), http://www.cs.wisc.edu/~shoup/ntl.
18. T. Takagi, “Fast RSA-type cryptosystem modulo pkq”, in Proc. Crypto '98, pp. 318-326, 1998.
19. P. Zimmerman, private communications.