Title | The development of the number field sieve [electronic resource] / edited by Arjen K. Lenstra, Hendrik W. Lenstra |
---|---|

Imprint | Berlin, Heidelberg : Springer Berlin Heidelberg, 1993 |

Connect to | http://dx.doi.org/10.1007/BFb0091534 |

Descript | VIII, 140 p. online resource |

SUMMARY

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

CONTENT

The number field sieve: An annotated bibliography -- Factoring with cubic integers -- The number field sieve -- The lattice sieve -- Factoring integers with the number field sieve -- Computing a square root for the number field sieve -- A general number field sieve implementation

Mathematics
Applied mathematics
Engineering mathematics
Number theory
Combinatorics
Mathematics
Applications of Mathematics
Number Theory
Combinatorics