The development of the number field sieve pp 95-102 | Cite as
Computing a square root for the number field sieve
Abstract
The number field sieve is a method proposed by Lenstra, Lenstra, Manasse and Pollard for integer factorization (this volume, pp. 11–42). A heuristic analysis indicates that this method is asymptotically faster than any other existing one. It has had spectacular successes in factoring numbers of a special form. New technical difficulties arise when the method is adapted for general numbers (this volume, pp. 50–94). Among these is the need for computing the square root of a huge algebraic integer given as a product of hundreds of thousands of small ones. We present a method for computing such a square root that avoids excessively large numbers. It works only if the degree of the number field that is used is odd. The method is based on a careful use of the Chinese remainder theorem.
Preview
Unable to display preview. Download preview PDF.
References
- 1.L.M. Adleman, Factoring numbers using singular integers, Proc. 23rd Annual ACM Symp. on Theory of Computing (STOC) (1991), 64–71.Google Scholar
- 2.D.J. Bernstein, A.K. Lenstra, A general number field sieve implementation, this volume, pp. 103–126.Google Scholar
- 3.J.P. Buhler, H.W. Lenstra, Jr., Carl Pomerance, Factoring integers with the number field sieve, this volume, pp. 50–94.Google Scholar
- 4.D.E. Knuth, The art of computer programming, volume 2, second edition, Addison-Wesley, Reading, Mass., 1981.MATHGoogle Scholar
- 5.E. Landau, Sur quelques théorèmes de M. Petrovic relatifs aux zéros des fonctions analytiques, Bull. Soc. Math. France 33 (1905), 251–261.MathSciNetMATHGoogle Scholar
- 6.S. Lang, Algebraic number theory, Addison-Wesley, Reading, Massachusetts, 1970.MATHGoogle Scholar
- 7.A.K. Lenstra, H.W. Lenstra, Jr., M.S. Manasse, J.M. Pollard, The number field sieve, this volume, pp. 11–42. Extended abstract: Proc. 22nd Annual ACM Symp. on Theory of Computing (STOC) (1990), 564–572.Google Scholar
- 8.M. Mignotte, Mathématiques pour le calcul formel, Presses Universitaires de France, Paris, 1989.MATHGoogle Scholar
- 9.P.L. Montgomery, R.D. Silverman, An FFT extension to the P — 1 factoring algorithm, Math. Comp. 54 (1990), 839–854.MathSciNetMATHGoogle Scholar
- 10.B.L. van der Waerden, Algebra, seventh edition, Springer-Verlag, Berlin, 1966.MATHGoogle Scholar