Factoring Integere with the Number Fleld Sieve Version 19920507
Factoring integere with the number fleld sieve version 19920507 Factoring integers with the number field sieve J.P. Buhler, H.W. Lenstra, Jr., and Carl Pomerance Abstract. In 1990, the ninth Fermat number was factored into primes by means of a new algorithm, the "number field sieve", which was invented by John Pollard. The present paper is devoted to the description and analysis of a more general version of the number field sieve. It should be possible to use this algorithm to factor arbitrary integers into prime factors, not just integers of a special form like the ninth Fermat number. Under reasonable heuristic assumptions, the analysis predicts that the time needed by the general number field sieve to factor n is exp((c+o(l))(logn)1/3(loglogn)2/3) (for n-*oo), where c=(64/9)l/3 = 1.9223. This is asymptotically faster than all other known factoring algorithms, such äs the quadratic sieve and the elliptic curve method. There does not yet exist an Implementation of the number field sieve for general integers, so that a practical comparison cannot yet be made. Key words: factoring integers, algebraic number fields. 1991 Mathematics subject classification: 11Y05, 11Y40. Acknowledgements. The authors wish to thank Dan Bernstein, Arjeh Cohen, Michael Filaseta, Andrew Gran- ville, Arjen Lenstra, Victor Miller, Robert Rumely, and Robert Silverman for their helpful suggestions. The authors were supported by NSF under Grants No. DMS 90-12989, No. DMS 90-02939, and No. DMS 90-02538, respectively. The second and third authors are grateful to the Institute for Advanced Study (Princeton), where pari of the work on which this paper is based was done.
[Show full text]