Stefania Cavallar, B. Dodson, A.K. Lenstra, P.C. Leyland, W.M. Lioen, P.L. Montgomery, B. Murphy, et al.  Home/Search
Context Related
| cwi.nl/ftp/CWIreports/...MASR9925.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cwi.nl/static/publica...MASR9925 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: On February 2, 1999, we completed the factorization of the 140--digit number RSA--140 with the help of the Number Field Sieve factoring method (NFS). This is a new general factoring record. The previous record was established on April 10, 1996 by the factorization of the 130--digit number RSA--130, also with the help of NFS. The amount of computing time spent on RSA--140 was roughly twice that needed for RSA--130, about half of what could be expected from a straightforward extrapolation of... (Update)
Context of citations to this paper: More
...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...
Cited by: More
Some Parallel Algorithms for Integer Factorisation - Brent (1999) (Correct)
Recent Progress and Prospects for Integer Factorisation Algorithms - Brent (2000) (Correct)
Discrete logarithms: The past and the future - Odlyzko (1999) (Correct)
Similar documents (at the sentence level):
6.7%: Factorization of a 512-bit RSA Modulus - Cavallar, Dodson, Lenstra, Lioen, .. (2000) (Correct)
5.1%: Polynomial Selection for the Number Field Sieve Integer.. - Murphy (1999) (Correct)
Active bibliography (related documents): More All
0.5: How To Find Small Factors Of Integers - Bernstein (2000) (Correct)
0.3: Computational Number Theory at CWI in 1970-1994 - Riele, Lune (1994) (Correct)
0.3: The Three-Large-Primes Variant of the Number Field Sieve - Cavallar (Correct)
Similar documents based on text: More All
1.7: Factorizations of Cunningham numbers with bases 13 to.. - Brent, Montgomery, Riele (2001) (Correct)
1.3: On the Size of Solutions of the Inequality $ \phi (ax + B) < \phi.. - Riele (2001) (Correct)
0.8: New computations concerning the Cohen-Lenstra heuristics - Williams, Riele (Correct)
Related documents from co-citation: More All
4: A public key cryptosystem and signature scheme based on discrete logarithms (context) - Gamal - 1985
4: Solving sparse linear equations over finite fields (context) - Wiedemann - 1986
4: A pipeline architecture for factoring large integers with the quadratic sieve al.. (context) - Pomerance, Smith et al. - 1988
BibTeX entry: (Update)
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. http://citeseer.ist.psu.edu/436337.html More
@inproceedings{ cavallar99factorization,
author = "Stefania Cavallar and Bruce Dodson and Arjen K. Lenstra and Paul C. Leyland and Walter M. Lioen and Peter L. Montgomery and Brian Murphy and Herman te Riele and Paul Zimmermann",
title = "Factorization of {RSA}-140 Using the Number Field Sieve",
booktitle = "{ASIACRYPT}",
pages = "195-207",
year = "1999",
url = "citeseer.ist.psu.edu/436337.html" }
Citations (may not include all citations):1529 A method for obtaining digital signatures and public-key cry.. - Rivest, Shamir et al. - 1978
43 Factoring with two large primes (context) - Lenstra, Manasse - 1991
39 The Quadratic Sieve Factoring Algorithm (context) - Pomerance - 1985
37 THE MAGIC WORDS ARE SQUEAMISH OSSIFRAGE (context) - Atkins, Gra et al. - 1995
35 Factoring integers with the number field sieve (context) - Buhler, Lenstra et al.
32 Factoring by Electronic Mail (context) - Lenstra, Manasse - 1990
27 A block Lanczos algorithm for finding dependencies over GF (context) - Montgomery - 1995
25 Implementation of a new primality test (context) - Cohen, Lenstra - 1987
20 NFS with four large primes: an explosive experiment (context) - Dodson, Lenstra - 1995
19 volume 1554 of Lecture Notes in Mathematics (context) - Lenstra, Lenstra et al. - 1993
15 The lattice sieve (context) - Pollard
11 Primality proving with cyclotomy (context) - Bosma, van der Hulst - 1990
10 Factoring Large Numbers with the TWINKLE device (context) - Shamir - 1999
9 An implementation of the number field sieve - Elkenbracht-Huizing - 1996
6 the factorization of RSA - Denny, Dodson et al.
6 Modelling the Yield of Number Field Sieve Polynomials (context) - Murphy - 1998
5 Lattice sieving and trial division (context) - Golliver, Lenstra et al. - 1994
4 Strategies for filtering in the Number Field Sieve - Cavallar
3 Improved Polynomial Selection for the Number Field Sieve (context) - Montgomery, Murphy - 1999
3 Factoring integers with the number field sieve (context) - Elkenbracht-Huizing - 1997
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