The development of the number field sieve / A.K. Lenstra, H.W. Lenstra, Jr.

By: Lenstra, A. K. (Arjen K.), 1956-
Contributor(s): Lenstra, H. W
Material type: TextTextSeries: Lecture notes in mathematics (Springer-Verlag): 1554.Publisher: Berlin ; New York : Springer-Verlag, ©1993Description: 1 online resource (viii, 131 pages) : illustrationsContent type: text Media type: computer Carrier type: online resourceISBN: 9783540478928; 3540478922Subject(s): Sieves (Mathematics) | Cribles (Mathématiques) | Sieves (Mathematics) | Algebraischer Zahlkörper | Siebmethode | Zahlentheorie | Faktorisierung | Algorithmus | Aufsatzsammlung | Getaltheorie | Teoria Dos NumerosGenre/Form: Electronic books. Additional physical formats: Print version:: Development of the number field sieve.DDC classification: 510 s | 512/.72 LOC classification: QA3 | .L28 no. 1554 | QA246Other classification: 31.14 Online resources: Click here to access online
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.
Action note: digitized 2010 committed to preserveSummary: 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.
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Item type Current location Collection Call number Status Date due Barcode Item holds
eBook eBook e-Library

Electronic Book@IST

EBook Available
Total holds: 0

Includes bibliographical references and index.

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.

Use copy Restrictions unspecified star MiAaHDL

Electronic reproduction. [Place of publication not identified] : HathiTrust Digital Library, 2010. MiAaHDL

Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002. MiAaHDL

http://purl.oclc.org/DLF/benchrepro0212

digitized 2010 HathiTrust Digital Library committed to preserve pda MiAaHDL

Print version record.

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.

There are no comments for this item.

to post a comment.

Powered by Koha