The development of the number field sieve
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 fo...
Wedi'i Gadw mewn:
| Prif Awdur: | |
|---|---|
| Awduron Eraill: | |
| Fformat: | Livre numérique |
| Iaith: | Anglais |
| Cyhoeddwyd: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Cyfres: | Lecture notes in mathematics
1554 |
| Pynciau: | |
| Mynediad Ar-lein: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nodyn: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • The development of the number field sieve, A.K. Lenstra, H.W. Lenstra, Jr (eds), 1993, Berlin, Springer-Verlag, 1 volume (VIII-131 pages), Lecture notes in mathematics, 0-387-57013-6 • The Development of the Number Field Sieve, Texte imprimé, 9783662167045 |
Tabl Cynhwysion:
- 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.