An Introduction to the General Number Field Sieve
Briggs M.
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 prevalent methods for transmitting and receiving secret data. In fact, GNFS was used recently to factor a 130-digit "challenge" number published by RSA, the largest number of cryptographic significance ever factored.
Kategoriler:
Yıl:
1998
Dil:
english
Sayfalar:
84
Dosya:
PDF, 850 KB
IPFS:
,
english, 1998
Amazon 
Barnes & Noble 
Bookshop.org
Bir kitap dükkanı eklemek ister misiniz? Bize support@z-lib.do adresinden ulaşın
Dosyaları dönüştürün
Diğer arama sonuçları
Diğer avantajları 
![Henry Cohn, Joshua Greene, Jonathan Hanke — Algebraic number theory and quadratic reciprocity [Lecture notes]](https://s3proxy.cdn-zlib.se/covers200/collections/genesis/d71b4ca1e50c0611f80fa040d8a93b295a5df458bececdebc1a721f7dcd9a551.jpg)
![Tom Weston — Algebraic Number Theory [Lecture notes]](https://s3proxy.cdn-zlib.se/covers200/collections/genesis/2ad1a1b12332323b1bede5381e79ddf781db6ed08e2e4967c4a3f519ed7af26c.jpg)
