Factorization of rsa–140 using the number field sieve

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

Volumn 1716, Issue , 1999, Pages 208-218

  Cavallar, Stefania ^a   Dodson, Bruce ^b   Lenstra, Arjen ^c   Leyland, Paul ^d   Lioen, Walter ^a   Montgomery, Peter L ^d   Murphy, Brian ^e   Te Riele, Herman ^a   Zimmermann, Paul ^f  

^a CWI   (Netherlands)

^b LEHIGH UNIVERSITY   (United States)

^c Citibank NA   (United States)

^d MICROSOFT RESEARCH   (United States)

^e AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

^f LORIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; CRYPTOGRAPHY; SECURITY OF DATA; SIEVES;

COMPUTING TIME; NUMBER FIELD SIEVE; POLYNOMIAL SELECTION; RSA MODULI; SPEED UP;

FACTORIZATION;

EID: 22844453978     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (21)

1. D. Atkins, M. Graff, A.K. Lenstra, and P.C. Leyland. THE MAGIC WORDS ARE SQUEAMISH OSSIFRAGE. In J. Pieprzyk and R. Safavi-Naini, editors, Advances in Cryptology – Asiacrypt’94, volume 917 of Lecture Notes in Computer Science, pages 265–277, Springer-Verlag, Berlin, 1995.
2. Wieb Bosma and Marc-Paul van der Hulst. Primality proving with cyclotomy. PhD thesis, University of Amsterdam, December 1990. J.P. Buhler, H.W. Lenstra, Jr., and Carl Pomerance. Factoring integers with the number field sieve. Pages 50–94 in [13].
3. S. Cavallar. Strategies for filtering in the Number Field Sieve. In preparation.
4. H. Cohen and A.K. Lenstra. Implementation of a new primality test. Mathematics of Computation, 48:103–121, 1987.
5. James Cowie, Bruce Dodson, R.-Marije Elkenbracht-Huizing, Arjen K. Lenstra, Peter L. Montgomery, and Jörg Zayer. A world wide number field sieve factoring record: on to 512 bits. In Kwangjo Kim and Tsutomu Matsumoto, editors, Advances in Cryptology – Asiacrypt’96, volume 1163 of Lecture Notes in Computer Science, pages 382–394, Springer-Verlag, Berlin, 1996.
6. T. Denny, B. Dodson, A.K. Lenstra, and M.S. Manasse, On the factorization of RSA–120. In D.R. Stinson, editor, Advances in Cryptology – Crypto’93, volume 773 of Lecture Notes in Computer Science, pages 166–174, Springer-Verlag, Berlin, 1994.
7. B. Dodson and A. K. Lenstra. NFS with four large primes: an explosive experiment. In D. Coppersmith, editor, Advances in Cryptology – Crypto’95, volume 963 of Lecture Notes in Computer Science, pages 372–385, Springer-Verlag, Berlin, 1995.
8. Marije Elkenbracht-Huizing. Factoring integers with the number field sieve. PhD thesis, Leiden University, May 1997.
9. R.-M. Elkenbracht-Huizing. An implementation of the number field sieve. Experimental Mathematics, 5:231–253, 1996.
10. R. Golliver, A.K. Lenstra, and K.S. McCurley. Lattice sieving and trial division. In Leonard M. Adleman and Ming-Deh Huang, editors, Algorithmic Number Theory, (ANTS-I, Ithaca, NY, USA, May 1994), volume 877 of Lecture Notes in Computer Science, pages 18–27, Springer-Verlag, Berlin, 1994.
11. A.K. Lenstra and H.W. Lenstra, Jr., editors. The Development of the Number Field Sieve, volume 1554 of Lecture Notes in Mathematics. Springer-Verlag, Berlin, 1993.
12. A.K. Lenstra and M.S. Manasse. Factoring by Electronic Mail. In J.-J. Quisquater and J. Vandewalle, editors, Advances in Cryptology – Eurocrypt’89, volume 434 of Lecture Notes in Computer Science, pages 355–371. Springer-Verlag, Berlin, 1990.
13. A.K. Lenstra and M.S. Manasse. Factoring with two large primes. In I.B. Dámgard, editor, Advances in Cryptology – Eurocrypt’90, volume 473 of Lecture Notes in Computer Science, pages 72–82. Springer-Verlag, Berlin, 1991.
14. Peter L. Montgomery. Square roots of products of algebraic numbers. In Walter Gautschi, editor, Mathematics of Computation 1943–1993: a Half-Century of Computational Mathematics, pages 567–571. Proceedings of Symposia in Applied Mathematics, American Mathematical Society, 1994.
15. Peter L. Montgomery. A block Lanczos algorithm for finding dependencies over GF(2). In Louis C. Guillou and Jean-Jacques Quisquater, editors, Advances in Cryptology – Eurocrypt’95, volume 921 of Lecture Notes in Computer Science, pages 106–120, Springer-Verlag, Berlin, 1995.
16. Peter L. Montgomery and Brian Murphy. Improved Polynomial Selection for the Number Field Sieve. Extended Abstract for the Conference on the Mathematics of Public-Key Cryptography, June 13–17, 1999, The Fields Institute, Toronto, Ontario, Canada. 197
17. B. Murphy. Modelling the Yield of Number Field Sieve Polynomials. J. Buhler, editor, Algorithmic Number Theory, (Third International Symposium, ANTS-III, Portland, O, USA, June 1998), volume 1423 of Lecture Notes in Computer Science, pages 137–151, Springer-Verlag, Berlin, 1998. 199
18. J.M. Pollard. The lattice sieve. Pages 43–49 in [13]. 202
19. Carl Pomerance. The Quadratic Sieve Factoring Algorithm. In T. Beth, N. Cot and I. Ingemarsson, editors, Advances in Cryptology – Eurocrypt’84, volume 209 of Lecture Notes in Computer Science, pages 169–182, Springer-Verlag, New York, 1985. 196
20. R.L. Rivest, A. Shamir, and L. Adleman. A method for obtaining digital signatures and public-key cryptosystems. Comm. ACM, 21:120–126, 1978. 196
21. A. Shamir. Factoring Large Numbers with the TWINKLE device. Manuscript, April, 1999. 197