The Development of the Number Field Sieve (Google eBook)

Front Cover
Arjen K. Lenstra, Hendrik W.Jr. Lenstra
Springer Science & Business Media, Aug 30, 1993 - Mathematics - 131 pages
0 Reviews
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.
  

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

I
1
II
4
IV
5
V
6
VI
7
VII
9
VIII
10
X
11
XXXIII
57
XXXIV
60
XXXV
63
XXXVI
67
XXXVII
70
XXXVIII
76
XXXIX
80
XL
84

XII
14
XIII
20
XIV
25
XV
29
XVI
30
XVII
33
XVIII
34
XIX
38
XX
40
XXI
43
XXIII
45
XXIV
46
XXV
48
XXVI
49
XXVIII
50
XXX
52
XXXI
54
XXXII
55
XLI
92
XLII
95
XLIV
98
XLV
102
XLVI
103
XLVIII
104
L
107
LI
108
LIII
114
LIV
115
LV
116
LVII
118
LVIII
120
LIX
124
LX
125
LXI
127
LXII
129
Copyright

Common terms and phrases

References to this book

All Book Search results »

Bibliographic information