✦ LIBER ✦

The Development of the Number Field Sieve

✍ Scribed by Arjen K. Lenstra, Hendrik W.Jr. Lenstra

Book ID: 127401626
Publisher: Springer
Year: 1993
Tongue: English
Weight: 127 KB
Edition: 1
Category: Library
ISBN-13: 9783540570134

No coin nor oath required. For personal study only.

✦ Synopsis

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 form, but there is a promising variant that applies in general. This volume contains six research papers that describe the operation of the number field sieve, from both theoretical and practical perspectives. Pollard's original manuscript is included. In addition, there is an annotated bibliography of directly related literature.

📜 SIMILAR VOLUMES

The development of the number field siev

The development of the number field sieve

✍ H. W. Lenstra Jr. (auth.), Arjen K. Lenstra, Hendrik W. Lenstra Jr. (eds.) 📂 Library 📅 1993 🏛 Springer 🌐 English ⚖ 1 MB

Development of the Number Field Sieve

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

Survey of the number field sieve

✍ Nakamula. 📂 Library 🌐 English ⚖ 81 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

Implementation of the general number fie

Implementation of the general number field sieve

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

Quadratic polynomials for the number fie

Quadratic polynomials for the number field sieve

✍ Murphy, Brent. 📂 Library 🌐 English ⚖ 142 KB