Computing a square root for the number field sieve
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.
Unable to display preview. Download preview PDF.
- 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
- 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