Implementation of the general number field sieve

✍ Scribed by Buchmann et al.

Tongue: English
Leaves: 7
Category: Library

⬇ Acquire This Volume

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An Introduction to the General Number Fi

📁 An Introduction to the General Number Field Sieve

✍ Briggs M. 📂 Library 📅 1998 🌐 English

The General Number Field Sieve (GNFS) is the fastest known method for factoring "large" integers, where large is generally taken to mean over 110 digits. This makes it the best algorithm for attempting to unscramble keys in the RSA [2, Chapter 4] public-key cryptography system, one of the most preva

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 Development of the Number Field Siev

📁 The Development of the Number Field Sieve

✍ Arjen K. Lenstra, Hendrik W.Jr. Lenstra 📂 Library 📅 1993 🏛 Springer 🌐 English

The development of the number field siev

📁 The development of the number field sieve

✍ H. W. Lenstra Jr. (auth.), Arjen K. Lenstra, Hendrik W. Lenstra Jr. (eds.) 📂 Library 📅 1993 🏛 Springer-Verlag Berlin Heidelberg 🌐 English

Number field sieve

📁 Number field sieve

✍ Brent. 📂 Library 🌐 English