Stragies in filtering in the number field sieve

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

Volumn 1838, Issue , 2000, Pages 209-231

  Cavallar, Stefania ^a  

^a CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

NUMBER THEORY; SIEVES;

BLOCK LANCZOS ALGORITHM; CRITICAL STEPS; FILTER STRATEGY; LANCZOS; MATRIX SIZE; NUMBER FIELD SIEVE; RUNNING TIME; SPARSE MATRICES;

MATRIX ALGEBRA;

EID: 84946832616     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10722028_11     Document Type: Conference Paper

References (19)

1. Hendrik Boender. Factoring Large Integers with the Quadratic Sieve. PhD thesis, Rijksuniversiteit Leiden, 1997.
2. Joe P. Buhler, Hendrik W. Lenstra, Jr., and Carl Pomerance. Factoring integers with the number field sieve. In Arjen K. Lenstra and Hendrik W. Lenstra, Jr., editors, The development of the number field sieve, number 1554 in Lecture Notes in Mathematics, pages 50-94, Springer-Verlag, 1993.
3. Stefania Cavallar, Bruce Dodson, Arjen K. Lenstra, Paul Leyland, Walter Lioen, Peter L. Montgomery, Brian Murphy, Herman te Riele, and Paul Zimmermann. Factorization of RSA-140 using the number field sieve. In Kwok Yan Lam, Eiji Okamoto, and Chaoping Xing, editors, Advances in Cryptology - Asiacrypt '99, volume 1716 of Lecture Notes in Computer Science, pages 195-207, Springer-Verlag, 1999.
4. Stefania Cavallar, Bruce Dodson, Arjen K. Lenstra, Paul Ley-land, Walter Lioen, Peter L. Montgomery, Herman te Riele, and Paul Zimmermann. 211-digit SNFS factorization. Available from ftp://ftp.cwi.nl/pub/herman/NFSrecords/SNFS-211, April 1999.
5. Stefania Cavallar, Bruce Dodson, Arjen K. Lenstra, Walter Lioen, Peter L. Montgomery, Brian Murphy, Herman te Riele, Karen Aardal, Je Gilchrist, Gérard Guillerm, Paul Leyland, Joël Marchand, François Morain, Alec Muffett, Chris Putnam, Craig Putnam, and Paul Zimmermann. Factorization of a 512-bit RSA modulus. Submitted to Eurocrypt 2000.
6. 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, 1996.
7. Thomas F. Denny. Solving large sparse systems of linear equations over finite prime fields. Transparencies of a lecture of the Cryptography Group at CWI, May 1995.
8. Reina-Marije Elkenbracht-Huizing. An implementation of the number field sieve. Experimental Mathematics, 5(3): 231-253, 1996.
9. Ronald L. Graham and Pavol Hell. On the history of the minimum spanning tree problem. Annals of the History of Computing, 7(1): 43-57, January 1985.
10. Jürgen Neukirch. Algebraische Zahlentheorie. Springer-Verlag, 1992.
11. Donald E. Knuth. The Stanford Graph Base: A Platform for Combinatorial computing. Addison-Wesley, 1993.
12. Donald E. Knuth. Sorting and Searching, volume 3 of The Art of Computer Programming. Addison-Wesley, second edition, 1998.
13. Brian A. LaMacchia and Andrew M. Odlyzko. Solving large sparse linear systems over finite fields. In A. J. Menezes and S. A. Vanstone, editors, Advances in Cryptology - Crypto '90, volume 537 of Lecture Notes in Computer Science, pages 109-133, Springer-Verlag, 1991.
14. Serge Lang. Algebraic Number Theory. Springer, 1986.
15. Peter L. Montgomery. Square roots of products of algebraic numbers. In W. Gautschi, editor, Mathematics of Computation 1943-1993: a Half-Century of Computational Mathematics, volume 48 of Proceedings of Symposia in Applied Mathematics, pages 567-571, American Mathematical Society, 1994.
16. 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, 1995.
17. Phong Nguyen. A Montgomery-like square root for the number field sieve. In J. P. Buhler, editor, Algorithmic Number Theory - ANTS-III, volume 1423 of Lecture Notes in Computer Science, pages 151-168, Springer-Verlag, 1998.
18. J. M. Pollard. The lattice sieve. In Arjen K. Lenstra and Hendrik W. Lenstra, Jr., editors, The development of the number field sieve, number 1554 in Lecture Notes in Mathematics, pages 43-49, Springer-Verlag, 1993.
19. Carl Pomerance and J. W. Smith. Reduction of huge, sparse matrices over finite fields via created catastrophes. Experimental Mathematics, 1(2): 89-94, 1992.