The Multiple-Lattice Number Field Sieve
โ Bernstein D.J.
๐ Library
๐
1991
๐ English
โฆ LIBER โฆ
๐
Multiple-lattice number field sieve
โ Scribed by Bernstein.
- Tongue
- English
- Leaves
- 5
- Category
- Library
โฌ Acquire This Volume
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Number field sieve
โ Brent.
๐ Library
๐ English
Number field sieve factorization
โ Huizing.
๐ Library
๐ English
Algorithmic number theory: lattices, num
โ J.P. Buhler, P. Stevenhagen
๐ Library
๐
2008
๐ Cambridge University Press
๐ English
Survey of the number field sieve
โ Nakamula.
๐ Library
๐ English
Development of the Number Field Sieve
โ Lenstra H. W.
๐ Library
๐
1993
๐ English
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