S. Cavallar, B. Dodson, A. K. Lenstra, P. Leyland, W. Lioen, P. L. Montgomery, B. Murphy, H. te Riele and P. Zimmermann, Factorization of RSA-140 using the number field sieve, announced 4 February 1999. Available from ftp://ftp.cwi.nl/ pub/herman/NFSrecords/RSA-140 . Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Discrete logarithms: The past and the future - Odlyzko (1999) (6 citations) (Correct)
....machines, each with modest memory requirements and minor communication needs, linear equation solutions require a closely coupled system of processors with a large memory. Still, those requirements are not too onerous. For example, the recent factorization of a 140 decimal digit integer [CavallarLRLLMMZ] required finding a linear dependency among a system of almost 5 million equations in about that many unknowns, and this was accomplished in about 100 hours on a single fast processor using 810 MB of memory. This set was generated by structured Gaussian elimination from about 66 million equations ....
....of the same size, it is prudent to disregard this difference when choosing a cryptosystem. The current record in factoring a generally hard integer is that of the 140 decimal digit challenge integer from RSA Data Security, Inc. RSA 140, which was accomplished with the general number field sieve [CavallarLRLLMMZ]. Among Cunningham integers, the record is the factorization (by the same group as the one that factored RSA140) of a 211 decimal digit integer by the special number field sieve (email announcement of April 25, 1999 to [NMBRTHRY] The factorization of RSA 140 required about 2,000 MY (mips years, ....
S. Cavallar, W. Kioen, H. te Riele, B. Dodson, A. Lenstra, P. Leyland, P. Montgomery, B. Murphy, and P. Zimmermann, Factorization of RSA-140 using the number field sieve, to be published.
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, B. Murphy, H. te Riele and P. Zimmermann, Factorization of RSA-140 using the number field sieve, announced 4 February 1999. Available from ftp://ftp.cwi.nl/ pub/herman/NFSrecords/RSA-140 .
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, B. Murphy, H. te Riele and P. Zimmermann, Factorization of RSA-140 using the number field sieve, announced 4 February 1999. Available from ftp:// ftp.cwi.nl/pub/herman/NFSrecords/RSA-140 .
Recent Progress and Prospects for Integer Factorisation Algorithms - Brent (2000) (4 citations) (Correct)
No context found.
S. Cavallar, B. Dodson, A. K. Lenstra, P. Leyland, W. Lioen, P. L. Montgomery, B. Murphy, H. te Riele and P. Zimmermann, Factorization of RSA-140 using the number field sieve, announced 4 February 1999. Available from ftp://ftp.cwi.nl/ pub/herman/NFSrecords/RSA-140 .
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