Buch, Englisch, Band 1554, 140 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 236 g
Reihe: Lecture Notes in Mathematics
Buch, Englisch, Band 1554, 140 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 236 g
Reihe: Lecture Notes in Mathematics
ISBN: 978-3-540-57013-4
Verlag: Springer Berlin Heidelberg
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.
Zielgruppe
Research
Autoren/Hrsg.
Fachgebiete
- Mathematik | Informatik Mathematik Algebra Elementare Algebra
- Mathematik | Informatik Mathematik Numerik und Wissenschaftliches Rechnen Computeranwendungen in der Mathematik
- Mathematik | Informatik Mathematik Algebra Zahlentheorie
- Mathematik | Informatik Mathematik Numerik und Wissenschaftliches Rechnen Angewandte Mathematik, Mathematische Modelle
- Mathematik | Informatik Mathematik Algebra Homologische Algebra
Weitere Infos & Material
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.
