Logo - springer
Slogan - springer

Mathematics - Applications | The Development of the Number Field Sieve

The Development of the Number Field Sieve

Series: Lecture Notes in Mathematics, Vol. 1554

Lenstra, Arjen K., Lenstra, Hendrik W.Jr. (Eds.)

1993, VIII, 140 p.

Available Formats:

Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.

You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.

After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.


ISBN 978-3-540-47892-8

digitally watermarked, no DRM

The eBook version of this title will be available soon

learn more about Springer eBooks

add to marked items


Softcover (also known as softback) version.

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.


(net) price for USA

ISBN 978-3-540-57013-4

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days

add to marked items

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 Level » Research

Keywords » Algebra - Algebraic Number Fields - Computational Number Theory - Factoring algorithm - Prime - Prime Numbers - number theory

Related subjects » Applications - Number Theory and Discrete Mathematics

Table of contents 

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.

Popular Content within this publication 



Read this Book on Springerlink

Services for this book

New Book Alert

Get alerted on new Springer publications in the subject area of Applications of Mathematics.