ENGLISH

The development of the number field sieve

By Arjen K. Lenstra , H. W. Lenstra Jr. (auth.) , Hendrik W. Lenstra Jr. (eds.)

Book information

Publisher
Springer-Verlag Berlin Heidelberg
Year
1993
ISBN
3540570136, 9783540570134, 0387570136
DOI
10.1007/BFb0091534
LCC
QA3 .L28 no. 1554,QA246 .L28 no. 1554
Open Library ID
OL1397700M
Language
english
Format
DJVU
Filesize
1 MB (1087829 bytes)
Series
Lecture Notes in Mathematics 1554
Edition
1
Pages
140\141
Library
Kolxo3
DPI
300
Time added
2009-07-20 03:45:11
Number Theory; Combinatorics

Description

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 books