0 Bewertungen0% fanden dieses Dokument nützlich (0 Abstimmungen)
23 Ansichten45 Seiten
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.
Originaltitel
Factoring Integers With the Number Field Sieve - Scanned - 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.
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.