The Development of the Number Field Sieve : Lecture Notes in Mathematics - Arjen K. Lenstra

The Development of the Number Field Sieve

By: Arjen K. Lenstra (Editor), Hendrik W.Jr. Lenstra (Editor)

Paperback | 30 August 1993

At a Glance

Paperback


$64.99

or 4 interest-free payments of $16.25 with

 or 

Aims to ship in 7 to 10 business days

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 in Number Theory

Ergodic Theory - Simon Rubinstein-Salzedo

RRP $183.00

$164.80

10%
OFF
2ND STEP MATH OLYMPIAD PROB(V7) : Mathematical Olympiad - DEREK HOLTON
BOOK OF NUMBERS, THE - TIANXIN CAI & JIU DING

$95.75

The Tiger That Isn't : Seeing Through a World of Numbers - Andrew Dilnot
Primes as Sums of Fibonacci Numbers - Michael Drmota

RRP $197.00

$177.50

10%
OFF
Chord Transformations in Higher-Dimensional Networks - Rafael Cubarsi
Simply Maths : DK Simply - DK

RRP $19.99

$18.25