
The Development of the Number Field Sieve
Springer (Publisher)
Published on 30. August 1993
Book
Paperback/Softback
VIII, 140 pages
978-3-540-57013-4 (ISBN)
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.
More details
Series
Edition
1993 ed.
Language
English
Place of publication
Berlin
Germany
Publishing group
Springer Berlin
Target group
Professional and scholarly
Research
Edition type
Annotated edition
Illustrations
VIII, 140 p.
Dimensions
Height: 235 mm
Width: 155 mm
Thickness: 9 mm
Weight
236 gr
ISBN-13
978-3-540-57013-4 (9783540570134)
DOI
10.1007/BFb0091534
Schweitzer Classification
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.