Abstract
It was shown in [2] that under reasonable assumptions the general number field sieve (GNFS) is the asymptotically fastest known factoring algorithm. It is, however, not known how this algorithm behaves in practice. In this report we describe practical experience with our implementation of the GNFS whose first version was completed in January 1993 at the Department of Computer Science at the Universität des Saarlandes.
Chapter PDF
Similar content being viewed by others
References
J. Buchmann, J. Loho, J. Zayer, An implementation of the. general number field, sieve, full version, to appear 1993
J. P. Buhler, H. W. Lenstra, C. Pomerance, Factoring integers with the number field sieve, Lecture Notes in Mathematics 1554, pp. 50–94, Springer Verlag, 1993
J.-M. Couveignes, Computing a square root for the number field sieve, Lecture Notes in Mathematics 1554, pp. 95–102, Springer Verlag, 1993
D. E. Knuth, The Art of Computer Programming, vol. 2, Second Edition, Addison Wesley, 1981
A. K. Lenstra, H. W. Lenstra, M. S. Manasse, J. M. Pollard, The number field sieve, Abstract: Proc. 22nd Ann. ACM Syrup. on Theory of Computing (STOC)(1990),564–572
A. K. Lenstra, M. Manasse, Factoring with two large primes, preprint 1992
J. M. Pollard, The Lattice Sieve, Lecture Notes in Mathematics 1554, pp. 43–49, Springer Verlag, 1993
D. Shanks Five Number-Theoretic Algorithms, Proc. Second Manitoba Conference On Numerical Math., 1972, pp. 51–70
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Buchmann, J., Loho, J., Zayer, J. (1994). An implementation of the general number field sieve. In: Stinson, D.R. (eds) Advances in Cryptology — CRYPTO’ 93. CRYPTO 1993. Lecture Notes in Computer Science, vol 773. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48329-2_14
Download citation
DOI: https://doi.org/10.1007/3-540-48329-2_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57766-9
Online ISBN: 978-3-540-48329-8
eBook Packages: Springer Book Archive