S. Cavallar, B. Dodson, A. K. Lenstra, P. Leyland, W. Lioen, P. L. Montgomery, H. te Riele and P. Zimmermann, 211-digit SNFS factorization, announced 25 April 1999. Available from ftp://ftp.cwi.nl/pub/herman/NFSrecords/SNFS-211 . Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Recent Progress and Prospects for Integer Factorisation Algorithms - Brent (2000) (4 citations) (Correct)
....form x 2 = y 2 mod F 9 . The second such equation was nontrivial and gave the desired factorisation of F 9 . More recently, considerably larger numbers have been factored by SNFS, for example, the 211 digit number 10 211 1 was factored early in 1999 by a collaboration called The Cabal [13]. 6 The General Number Field Sieve (GNFS) The general number field sieve (GNFS or just NFS) is a logical extension of the special number field sieve (SNFS) When using SNFS to factor an integer N,we require two polynomials f(x)andg(x) with a common root m mod N but no common root over the field ....
S. Cavallar, B. Dodson, A. K. Lenstra, P. Leyland, W. Lioen, P. L. Montgomery, H. te Riele and P. Zimmermann, 211-digit SNFS factorization, announced 25 April 1999. Available from ftp://ftp.cwi.nl/pub/herman/NFSrecords/SNFS-211 .
Recent Progress and Prospects for Integer Factorisation Algorithms - Brent (4 citations) (Correct)
....the form x 2 = y 2 mod F 9 . The second such equation was nontrivial and gave the desired factorisation of F 9 . More recently, considerably larger numbers have been factored by SNFS, for example, the 211 digit number 10 211 1 was factored early in 1999 by a collaboration called The Cabal [13]. 6 The General Number Field Sieve (GNFS) The general number eld sieve (GNFS or just NFS) is a logical extension of the special number eld sieve (SNFS) When using SNFS to factor an integer N , we require two polynomials f(x) and g(x) with a common root m mod N but no common root over the eld ....
S. Cavallar, B. Dodson, A. K. Lenstra, P. Leyland, W. Lioen, P. L. Montgomery, H. te Riele and P. Zimmermann, 211-digit SNFS factorization, announced 25 April 1999. Available from ftp://ftp.cwi.nl/pub/herman/NFSrecords/SNFS-211 .
Strategies in Filtering in the Number Field Sieve - Cavallar (2000) Self-citation (Cavallar) (Correct)
....and data security . This report will appear in the proceedings of ANTS IV, Leiden, The Netherlands, July 2 7, 2000. Introduction The Number Field Sieve (NFS) is the asymptotically fastest algorithm known for factoring large integers. It holds the records in factoring special numbers (R211 [3]) as well as general numbers (RSA 140 [4] and RSA 155 [5] One disadvantage is that it produces considerably larger matrices than other methods, such as the Quadratic Sieve [1] Therefore it is more and more important to find ways to limit the matrix size. This can be achieved by using good ....
Stefania Cavallar, Bruce Dodson, Arjen K. Lenstra, Paul Leyland, 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.
Some Parallel Algorithms for Integer Factorisation - Brent (1999) (5 citations) (Correct)
No context found.
S. Cavallar, B. Dodson, A. K. Lenstra, P. Leyland, W. Lioen, P. L. Montgomery, H. te Riele and P. Zimmermann, 211-digit SNFS factorization, announced 25 April 1999. Available from ftp://ftp.cwi.nl/pub/herman/NFSrecords/SNFS-211 .
Some Parallel Algorithms for Integer Factorisation - Brent (1999) (5 citations) (Correct)
No context found.
S.Cavallar,B.Dodson,A.K.Lenstra,P.Leyland,W.Lioen,P.L.Montgomery, H. te Riele and P. Zimmermann, 211-digit SNFS factorization, announced 25 April 1999. Available from ftp://ftp.cwi.nl/pub/herman/NFSrecords/SNFS-211 .
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC