Picture 1 of 1
Stock photo
Picture 1 of 1
Stock photo
Lecture Notes in Mathematics Ser.: Development of the Number Field Sieve by Arjen K. Lenstra (1993, Trade Paperback)
Great Book Prices Store (356836)
97.7% positive feedback
Price:
$55.13
Free shipping
Returns:
14 days returns. Buyer pays for return shipping. If you use an eBay shipping label, it will be deducted from your refund amount.
Condition:
Development of the Number Field Sieve, Paperback by Lenstra, A. K. (EDT); Dold, A. (EDT), ISBN 3540570136, ISBN-13 9783540570134, Brand New, Free shipping in the US The number field sieve is an algorithm used to find the prime factors of large integers. It depends entirely on algebraic number theory. This volume contains six research papers which describe the operation of the number field sieve from both theoretical and practical perspectives.
- Buy It NowDevelopment of the Number Field Sieve, Paperback by Lenstra, A. K. (EDT); Dol...
Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
About this product
Product Identifiers
PublisherSpringer Berlin / Heidelberg
ISBN-103540570136
ISBN-139783540570134
eBay Product ID (ePID)102931910
Product Key Features
Number of PagesVIII, 140 Pages
LanguageEnglish
Publication NameDevelopment of the Number Field Sieve
SubjectGeneral, Number Theory, Applied, Discrete Mathematics
Publication Year1993
TypeTextbook
Subject AreaMathematics
AuthorArjen K. Lenstra
SeriesLecture Notes in Mathematics Ser.
FormatTrade Paperback
Dimensions
Item Weight16.9 Oz
Item Length9.3 in
Item Width6.1 in
Additional Product Features
Intended AudienceScholarly & Professional
TitleLeadingThe
Series Volume Number1554
Number of Volumes1 vol.
IllustratedYes
Table Of ContentThe 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.
SynopsisThe 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.
LC Classification NumberT57-57.97
