Abstract
We assume that the reader is familiar with the General Number Field Sieve (GNFS). This article describes a way to use more than two polynomials. Two, three and four polynomials are compared both for classical and for a special form of lattice sieving (line sieving). We present theoretical expectations and experimental results. With our present polynomial search algorithm, using more than two polynomials speeds up classical sieving considerably but not line sieving. Line sieving for two polynomials is the fastest way of sieving we tried so far.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
L.M. Adleman. Factoring numbers using singular integers. In Proceedings 23rd Annual ACM Symposium on Theory of Computing (STOC), pages 64–71, New Orleans, 1991.
R.P Brent, P.L. Montgomery, and H.J.J. te Riele. Update 2 to: Factorizations of a n±1,13≤a100. Technical Report NM-R9609, Centrum voor Wiskunde en Informatica, Amsterdam, 1996.
J. Buchmann, J. Loho, and J. Zayer. An implementation of the general number field sieve. In D.R. Stinson, editor, Advances in Cryptology — CRYPTO '93, volume 773 of Lecture Notes in Computer Science, pages 159–165, Berlin, 1994. Springer-Verlag.
J.P. Buhler, H.W. Lenstra, Jr., and C. Pomerance. Factoring integers with the number field sieve, pages 50–94 in [9]..
F.G. Frobenius. Über Beziehungen zwischen den Primidealen eines algebraischen Körpers und den Substitutionen seiner Gruppe. Sitzungsberichte der Königlich Preuβischen Akademie der Wissenschaften zu Berlin, pages 689–703, 1896. Also in Ferdinand George Frobenius, Gesammelte Abhandlungen, Band II, Springer-Verlag, Berlin, 1968.
R.A. Golliver, A.K. Lenstra, and K.S. McCurley. Lattice sieving and trial division. In L.M. Adleman and M.-D. Huang, editors, Algorithmic Number Theory, volume 877 of Lecture Notes in Computer Science, pages 18–27, Berlin, 1994. Springer-Verlag.
R.M. Huizing. An implementation of the number field sieve. Technical Report NM-R9511, Centrum voor Wiskunde en Informatica, Amsterdam, 1995. To appear in Experimental Mathematics.
S. Lang. Algebraic Number Theory. Addison-Wesley, Reading, MA, USA, 1970.
A.K. Lenstra and H.W. Lenstra, Jr. The development of the number field sieve, volume 1554 of Lecture Notes in Mathematics. Springer-Verlag, Berlin, 1993.
A.K. Lenstra, H.W. Lenstra, Jr., M.S. Manasse, and J.M. Pollard. The factorization of the ninth Fermat number. Mathematics of Computation, 61:319–349, 1993.
P. L. Montgomery. Square roots of products of algebraic numbers. In Walter Gautschi, editor, Mathematics of Computation 1943–1993: a Half-Century of Computational Mathematics, pages 567–571. Proceedings of Symposia in Applied Mathematics, American Mathematical Society, 1994. Long version to appear.
P. L. Montgomery. A block Lanczos algorithm for finding dependencies over GF(2). In L.C. Guillou and J.-J. Quisquater, editors, Advances in Cryptology — EURO-CRYPT '95, volume 921 of Lecture Notes in Computer Science, pages 106–120, Berlin, 1995. Springer-Verlag.
J. Neukirch. Algebraische Zahlentheorie. Springer-Verlag, Berlin, 1992.
J.M. Pollard. The lattice sieve, pages 43–49 in [9]..
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Elkenbracht-Huizing, M. (1996). A multiple polynomial general number field sieve. In: Cohen, H. (eds) Algorithmic Number Theory. ANTS 1996. Lecture Notes in Computer Science, vol 1122. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61581-4_45
Download citation
DOI: https://doi.org/10.1007/3-540-61581-4_45
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61581-1
Online ISBN: 978-3-540-70632-8
eBook Packages: Springer Book Archive