Number field sieve

Number field sieve factorization

✍ Huizing. 📂 Library 🌐 English ⚖ 194 KB

Multiple-lattice number field sieve

✍ Bernstein. 📂 Library 🌐 English ⚖ 66 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

Implementation of the general number fie

Implementation of the general number field sieve

✍ Buchmann et al. 📂 Library 🌐 English ⚖ 37 KB