Denny Dodson, B. Dodson, A. K. Lenstra, M. S. Manasse  Home/Search
Context Related
| informatik.tudarmstadt...RSA120.ps.gz informatik.tudarmstadt...RSA120.ps.gz 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: isa.informatik....DME.year.author (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . We present data concerning the factorization of the 120-digit number RSA-120, which we factored on July 9, 1993, using the quadratic sieve method. The factorization took approximately 825 MIPS years and was completed within three months real time. At the time of writing RSA-120 is the largest integer ever factored by a general purpose factoring algorithm. We also present some conservative extrapolations to estimate the difficulty of factoring even larger numbers, using either the quadratic... (Update)
Context of citations to this paper: More
...presented at cryptographic conferences. We mention Eurocrypt 89 (C100 1 [22] Eurocrypt 90 (C107 and C116 [23] Crypto 93 (C120, [13]) Asiacrypt 94 (C129, 2] Asiacrypt 96 (C130, 11] and Asiacrypt 99 (C140, 8] The C130 and C140 were factored with help of the...
...for Denny s implementation lies. The largest numbers presently factored with PPMPQS are a 120 digit number done in about 825 mips years [DDLM94], and the 129 digit RSA challenge described by Martin Gardner, done in about 5000 mips years with a factor base size of 524,339...
Cited by: More
How To Find Small Factors Of Integers - Bernstein (2000) (Correct)
Factorization of a 512-bit RSA Modulus - Cavallar, Lioen, Riele, Dodson.. (2000) (Correct)
Factorization of RSA-140 Using the Number Field Sieve - Cavallar, Dodson.. (Correct)
Active bibliography (related documents): More All
0.6: The Magic Words Are Squeamish Ossifrage (Extended Abstract) - Atkins, Graff, Lenstra.. (Correct)
0.5: A Survey on the Number Field Sieve - Nakamula (Correct)
0.2: Factoring Integers with the Self-Initializing Quadratic Sieve - Contini (1997) (Correct)
Similar documents based on text: More All
1.0: The Number Field Sieve - Lenstra, Lenstra, Jr., Manasse.. (1990) (Correct)
0.3: Factoring Integers with Large-Prime Variations of the.. - Boender, Riele (1995) (Correct)
0.2: Solving Large Sparse Linear Systems Over Finite Fields - LaMacchia, Odlyzko (1991) (Correct)
Related documents from co-citation: More All
6: The magic words are squeamish ossifrage (context) - Atkins, Graff et al. - 1995
5: Factoring with two large primes (context) - Lenstra, Manasse - 1990
5: The quadratic sieve factoring algorithm (context) - Pomerance - 1985
BibTeX entry: (Update)
T. Denny, B. Dodson, A. K. Lenstra, and M. S. Manasse. On the factorization of RSA-120. In D.R. Stinson, editor, Advances in Cryptology -- CRYPTO '93, volume 773 of Lecture Notes in Computer Science, pages 166--174, Berlin, 1994. Springer--Verlag. http://citeseer.ist.psu.edu/denny94factorization.html More
@article{ denny94factorization,
author = "T. Denny and Bruce Dodson and Arjen K. Lenstra and Mark S. Manasse",
title = "On the Factorization of {RSA-120}",
journal = "Lecture Notes in Computer Science",
volume = "773",
pages = "166--??",
year = "1994",
url = "citeseer.ist.psu.edu/denny94factorization.html" }
Citations (may not include all citations):72 The development of the number field sieve (context) - Lenstra, Lenstra - 1993
50 The number field sieve - Lenstra, Lenstra et al.
43 Factoring with two large primes (context) - Lenstra, Manasse - 1991
40 Computation of discrete logarithms in prime fields - LaMacchia, Odlyzko - 1991
39 The quadratic sieve factoring algorithm (context) - Pomerance - 1985
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
13 A general number field sieve implementation (context) - Bernstein, Lenstra
13 Factoring integers using SIMD sieves (context) - Dixon, Lenstra
7 sparse matrices over finite fields via created catastrophes (context) - Pomerance, Smith - 1992
5 Massively parallel computing and factoring (context) - Lenstra - 1992
2 information available by sending electronic mail to challeng.. (context) - Security, Inc et al. - 1991
1 An implementation of the multiple polynomial quadratic sieve (context) - Buchmann, Denny
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.isa.informatik.tu-darmstadt.de/TI/Veroeffentlichung/reports/README.year.author.html): More
On Some Computational Problems in Finite Abelian Groups - Buchmann, Jacobson, Teske (1997) (Correct)
Discrete Logarithms: the Effectiveness of the Index.. - Schirokauer, Weber, Denny (1996) (Correct)
Computing Discrete Logarithms in Real Quadratic Congruence .. - Müller, Stein, Thiel (1997) (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