Stefania Cavallar, Walter M. Lioen, H.J.J. te Riele, B. Dodson, A.K. Lenstra, P.L. Montgomery, B. Murphy, et al.  Home/Search
Context Related
| cwi.nl/ftp/CWIreports/...MASR0007.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/publicat...MAS2000 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: On August 22, 1999, we completed the factorization of the 512-bit 155-digit number RSA-155 with the help of the Number Field Sieve factoring method (NFS). This is a new record for factoring general numbers. Moreover, 512-bit RSA keys are frequently used for the protection of electronic commerce -- at least outside the USA -- so this factorization represents a breakthrough in research on RSA-based systems. The previous record, factoring the 140-digit number RSA-140, was established on February... (Update)
Context of citations to this paper: More
.... are considered within the bounds of ECM, since the work to nd such factors is within range of the work needed for the RSA 512 factoring project [5]. Consequently, for 1024 bit moduli one should not use more than three factors. 3.2 Multi power RSA: N = p q One can further speed...
Cited by: More
On the Cost of Factoring RSA-1024 - Shamir, Tromer (Correct)
Factoring estimates for a 1024-bit RSA modulus - Lenstra, Tromer, Shamir.. (Correct)
TTS: Rank Attacks in Tame-Like Multivariate PKCs - Yang, Chen (2004) (Correct)
Similar documents (at the sentence level):
78.1%: Factorization of a 512-bit RSA Modulus - Cavallar, Dodson, Lenstra, Lioen, .. (2000) (Correct)
5.9%: Factorization of RSA-140 Using the Number Field Sieve - Cavallar, Dodson.. (Correct)
Active bibliography (related documents): More All
1.1: How To Find Small Factors Of Integers - Bernstein (2000) (Correct)
0.6: Some Parallel Algorithms for Integer Factorisation - Brent (1999) (Correct)
0.6: Recent Progress and Prospects for Integer Factorisation Algorithms - Brent (2000) (Correct)
Similar documents based on text: More All
1.9: 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: The Three-Large-Primes Variant of the Number Field Sieve - Cavallar (Correct)
Related documents from co-citation: More All
5: Analysis and optimization of the TWINKLE factoring device (context) - Lenstra, Shamir - 2000
4: A Cost-Based Security Analysis of Symmetric and Asymmetric Key Lengths (context) - Silverman - 2000
4: Solving linear equations over GF (context) - Coppersmith - 1993
BibTeX entry: (Update)
Stefania Cavallar, Bruce Dodson, Arjen K. Lenstra, Walter Lioen, Peter L. Montgomery, Brian Murphy, Herman te Riele, Karen Aardal, Jeff Gilchrist, G'erard Guillerm, Paul Leyland, Joel Marchand, Francois Morain, Alec Muffett, Chris Putnam, Craig Putnam, and Paul Zimmermann. Factorization of a 512-bit RSA modulus. Submitted to Eurocrypt 2000. http://citeseer.ist.psu.edu/cavallar00factorization.html More
@inproceedings{ cavallar00factorization,
author = "Stefania Cavallar and Bruce Dodson and Arjen K. Lenstra and Walter M. Lioen and Peter L. Montgomery and Brian Murphy and Herman te Riele and Karen Aardal and Jeff Gilchrist and Gerard Guillerm and Paul C. Leyland and Joel Marchand and Francois Morain and Alec Muffett and Chris Putnam and Craig Putnam and Paul Zimmermann",
title = "Factorization of a 512-Bit {RSA} Modulus",
booktitle = "Theory and Application of Cryptographic Techniques",
pages = "1-18",
year = "2000",
url = "citeseer.ist.psu.edu/cavallar00factorization.html" }
Citations (may not include all citations):1529 A method for obtaining digital signatures and public-key cry.. - Rivest, Shamir et al. - 1978
98 Selecting Cryptographic Key Sizes - Lenstra, Verheul - 2000
51 The multiple polynomial quadratic sieve (context) - Silverman - 1987
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, Graff 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
29 The factorization of the Ninth Fermat number (context) - Lenstra, Lenstra et al. - 1993
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
19 Private communication (context) - Silverman
16 Factoring with the quadratic sieve on large vector computers (context) - Riele, Lioen et al. - 1989
15 The lattice sieve (context) - Pollard
11 Factoring numbers using singular integers (context) - Adleman - 1991
11 Primality proving with cyclotomy (context) - Bosma, van der Hulst - 1990
10 Factoring large numbers with the TWINKLE device (context) - Shamir - 1999
10 volume 22 of Contemporary Mathematics (context) - Brillhart, Lehmer et al. - 1988
9 An implementation of the number field sieve - Elkenbracht-Huizing - 1996
9 Polynomial Selection for the Number Field Sieve Integer Fact.. - Murphy - 1999
7 Some parallel algorithms for integer factorisation - Brent - 1999
7 A method of factoring and the factorization of (context) - Morrison, Brillhart - 1975
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
5 the Sandia National Laboratories (context) - Davis, Holdridge et al. - 1985
4 Strategies for filtering in the Number Field Sieve - Cavallar - 2000
4 Factoring with elliptic curves (context) - Lenstra - 1987
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
2 Morrison and John Brillhart (context) - Michael - 1971
2 Factoring using SIMD Sieves (context) - Dixon, Lenstra - 1994
2 Frequently Asked Questions about today's Cryptography (context) - Questions, Cryptography et al.
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cwi.nl/static/publications/reports/MAS-2000.html): More
The Askey Scheme for Hypergeometric Orthogonal Polynomials.. - Temme, López (2000) (Correct)
Compactification of -Spaces Revisited - de Vries (2000) (Correct)
Solving Vertical Transport and Chemistry in Air.. - Berkvens, Botchev.. (2000) (Correct)
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