On the factorization of RSA-120 (1994) [13 citations — 3 self]
ftp://ftp.informatik.tu-darmstadt.de/pub/TI/report
http://www.informatik.uni-bonn.de/~adrian/nfs/0773
DBLP
CACHED:
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 sieve method or the number field sieve, and discuss the issue of the crossover point between these two methods. On the factorization of RSA-120 Evaluation of integer factoring algorithms, both from a theoretical and practical point of view, is of great importance for anyone interested in the security of factoring-based public key cryptosystems. In this paper we concentrate on the practical aspects of factoring. Furthermore, we restrict ourselves to general purpose factoring algorithms, i.e., algo...
Citations
| 53 | The number field sieve – Lenstra, Lenstra, et al. - 1990 |
| 46 | Factoring by electronic mail – LENSTRA, MANASSE |
| 43 | Factoring integers with the number field sieve – Buhler, Jr, et al. - 1993 |
| 42 | The factorization of the ninth Fermat number – Lenstra, Lenstra, et al. - 1993 |
| 39 | Factoring with two large primes – Lenstra, Manasse - 1994 |
| 33 | Computation of discrete logarithms in prime fields – LaMacchia, Odlyzko - 1991 |
| 14 | Factoring integers using SIMD sieves – Dixon, Lenstra - 1994 |
| 12 | A general number field sieve implementation – Bernstein, Lenstra |
| 6 | Massively parallel computing and factoring – Lenstra - 1992 |
| 1 | F.: An implementation of the multiple polynomial quadratic sieve – Buchmann, Denny |
| 1 | eds): The development of the number field sieve – W - 1993 |
| 1 | The number field sieve. 11--42 – Lenstra, Lenstra, et al. |

