Abstract
The purpose of this paper is to report the unexpected results that we obtained while experimenting with the multi-large prime variation of the general number field sieve integer factoring algorithm (NFS, cf. [8]). For traditional factoring algorithms that make use of at most two large primes, the completion time can quite accurately be predicted by extrapolating an almost quartic and entirely ‘smooth’ function that counts the number of useful combinations among the large primes [1]. For NFS such extrapolations seem to be impossible—the number of useful combinations suddenly ‘explodes’ in an as yet unpredictable way, that we have not yet been able to understand completely. The consequence of this explosion is that NFS is substantially faster than expected, which implies that factoring is somewhat easier than we thought.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
D. Atkins, M. Graff, A.K. Lenstra, and P.C. Leyland, THE MAGIC WORDS ARE SQUEAMISH OSSIFRAGE, Asiacrypt’94, to appear.
J. Buchmann, J. Loho, and J. Zayer, Triple-large-prime variation, manuscript, 1993.
J. Buchmann, J. Loho, and J. Zayer, An implementation of the general number field sieve, Advances in Cryptology, Crypto’93, Lecture Notes in Comput. Sci. 773 (1994), 159–165.
S. Contini and A. K. Lenstra, Implementations of blocked Lanczos and Wiedemann algorithms, in preparation.
T. Denny, B. Dodson, A. K. Lenstra, and M. S. Manasse, On the factorization of RSA-120, Advances in Cryptology, Crypto’93, Lecture Notes in Comput. Sci. 773 (1994), 166–174.
R. Golliver, A. K. Lenstra, and K. McCurley, Lattice sieving and trial division, ANTS’94, Lecture Notes in Comput. Sci. 877 (1994), 18–27.
B. A. LaMacchia and A. M. Odlyzko, Solving Large Sparse Linear Systems over Finite Fields, Advances in Cryptology, Crypto’90, Lecture Notes in Comput. Sci. 537 (1991), 109–133.
A. K. Lenstra and H. W. Lenstra, Jr. (eds), The development of the number field sieve, Lecture Notes in Math. 1554, Springer-Verlag, Berlin, 1993.
A. K. Lenstra and M. S. Manasse, Factoring with two large primes, Math. Comp 63 (1994), 785–798.
P. L. Montgomery, Square roots of products of algebraic numbers, Proceedings of Symposia in Applied Mathematics, Mathematics of Computation 1943–1993, Vancouver, 1993, Walter Gautschi, ed.
P. L. Montgomery, A block Lanczos algorithm for finding dependencies over GF(2), Advances in Cryptology, Eurocrypt’95, Lecture Notes in Comput. Sci. 921 (1995), 106–120.
A. M. Odlyzko, Discrete Logarithms in Finite Fields and their Cryptographic Significance, Advances in Cryptology, Eurocrypt’84, Lecture Notes in Comput. Sci. 209, 224–314.
C. Pomerance, The quadratic sieve factoring algorithm, Advances in Cryptology, Eurocrypt’84, Springer, Lecture Notes in Comput. Sci. 209, 169–182.
C. Pomerance and J. W. Smith, Reduction of huge, sparse matrices over finite fields via created catastrophes, Experiment. Math. 1 (1992) 89–94.
B. Silverman, The multiple polynomial quadratic sieve, Math. Comp. 48 (1987), 329–339.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dodson, B., Lenstra, A.K. (1995). NFS with Four Large Primes: An Explosive Experiment. In: Coppersmith, D. (eds) Advances in Cryptology — CRYPT0’ 95. CRYPTO 1995. Lecture Notes in Computer Science, vol 963. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44750-4_30
Download citation
DOI: https://doi.org/10.1007/3-540-44750-4_30
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60221-7
Online ISBN: 978-3-540-44750-4
eBook Packages: Springer Book Archive