Number field sieve

✍ Scribed by Brent.

Tongue: English
Leaves: 20
Category: Library

⬇ Acquire This Volume

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Number field sieve factorization

📁 Number field sieve factorization

✍ Huizing. 📂 Library 🌐 English

Multiple-lattice number field sieve

📁 Multiple-lattice number field sieve

✍ Bernstein. 📂 Library 🌐 English

Survey of the number field sieve

📁 Survey of the number field sieve

✍ Nakamula. 📂 Library 🌐 English

Development of the Number Field Sieve

📁 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

The Multiple-Lattice Number Field Sieve

📁 The Multiple-Lattice Number Field Sieve

✍ Bernstein D.J. 📂 Library 📅 1991 🌐 English

Implementation of the general number fie

📁 Implementation of the general number field sieve

✍ Buchmann et al. 📂 Library 🌐 English