Quadratic polynomials for the number field sieve

Non-linear polynomial selection for the

Non-linear polynomial selection for the number field sieve

✍ Thomas Prest; Paul Zimmermann 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 228 KB

The “large sieve” in quadratic fields

✍ M. Maknys 📂 Article 📅 1981 🏛 Springer 🌐 English ⚖ 349 KB

Modifications to the Number Field Sieve

✍ Don Coppersmith 📂 Article 📅 1993 🏛 Springer 🌐 English ⚖ 469 KB

I-LLMP'I and Buhler et al. I'BLP], is a new routine for factoring integers. We present here a modification of that sieve. We use the fact that certain smoothness computations can be reused, and thereby reduce the asymptotic running time of the Number Field Sieve. We also give a way to precompute tab

Development of the Number Field Sieve

✍ Lenstra H. W. 📂 Library 📅 1993 🌐 English ⚖ 611 KB

The number field sieve is an algorithm for finding the prime factors of large integers. It depends on algebraic number theory. Proposed by John Pollard in 1988, the method was used in 1990 to factor the ninth Fermat number, a 155-digit integer. The algorithm is most suited to numbers of a special fo

Survey of the number field sieve

✍ Nakamula. 📂 Library 🌐 English ⚖ 81 KB

The Development of the Number Field Siev

The Development of the Number Field Sieve

✍ Arjen K. Lenstra, Hendrik W.Jr. Lenstra 📂 Library 📅 1993 🏛 Springer 🌐 English ⚖ 127 KB

The number field sieve is an algorithm for finding the prime factors of large integers. It depends on algebraic number theory. Proposed by John Pollard in 1988, the method was used in 1990 to factor the ninth Fermat number, a 155-digit integer. The algorithm is most suited to numbers of a special fo