Abstract
This is a report on work in progress on our new implementation of the relation collection stage of the general number field sieve integer factoring algorithm. Our experiments indicate that we have achieved a substantial speed-up compared to other implementations that are reported in the literature. The main improvements are a new lattice sieving technique and a trial division method that is based on lattice sieving in a hash table. This also allows us to collect triple and quadruple large prime relations in an efficient manner. Furthermore we show how the computation can efficiently be shared among multiple processors in a high-band-width environment.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
D. Atkins, M. Graff, A. K. Lenstra, P. C. Leyland, Title to be announced, in preparation
D. J. Bernstein, A. K. Lenstra, A general number field sieve implementation, 103–126 in: [8]
J. Buchmann, J. Loho, J. Zayer, An implementation of the general number field sieve, Advances in Cryptology, Proceedings Crypto'93, Lecture Notes in Comput. Sci. 773 (1994) 159–165
J. Buchmann, J. Loho, J. Zayer, Triple-large-prime variation, manuscript, 1993
B. Dodson, A. K. Lenstra, NFS with four large primes: an explosive experiment, in preparation
Intel Corporation, Paragon(tm) XP/S Product Overview, 1991
A. K. Lenstra, H. W. Lenstra, Jr., Algorithms in number theory, Chapter 12 in: J. van Leeuwen (ed.), Handbook of theoretical computer science, Volume A, Algorithms and complexity, Elsevier, Amsterdam, 1990
A. K. Lenstra, H. W. Lenstra, Jr. (eds), The development of the number field sieve, Lecture Notes in Math. 1554, Springer-Verlag, Berlin, 1993
A.K. Lenstra, H.W. Lenstra, Jr., M.S. Manasse, J. M. Pollard, The number field sieve, 11–42 in: [8]
A. K. Lenstra, M. S. Manasse, Factoring by electronic mail, Advances in Cryptology, Eurocrypt '89, Lecture Notes in Comput. Sci. 434 (1990) 355–371
B. Maccabe, K. S. McCurley, R. Riesen, SUNMOS for the Intel Paragon: A Brief User's Guide, Sandia National Laboratories Technical Report # SAND 93-1024
J. M. Pollard, The lattice sieve, 43–49 in: [8]
RSA Data Security Corporation Inc., sci.crypt, May 18, 1991; public information available by sending electronic mail to challenge-rsa-list@rsa.com
J. Zayer, personal communication, September 1993
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Golliver, R.A., Lenstra, A.K., McCurley, K.S. (1994). Lattice sieving and trial division. In: Adleman, L.M., Huang, MD. (eds) Algorithmic Number Theory. ANTS 1994. Lecture Notes in Computer Science, vol 877. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58691-1_38
Download citation
DOI: https://doi.org/10.1007/3-540-58691-1_38
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58691-3
Online ISBN: 978-3-540-49044-9
eBook Packages: Springer Book Archive