1![SMOOTH NUMBERS AND THE QUADRATIC SIEVE Carl Pomerance When faced with a large number n to factor, what do you do first? You might say “Look at the last digit,” with the idea of cheaply pulling out possible factors of SMOOTH NUMBERS AND THE QUADRATIC SIEVE Carl Pomerance When faced with a large number n to factor, what do you do first? You might say “Look at the last digit,” with the idea of cheaply pulling out possible factors of](https://www.pdfsearch.io/img/7dc121e9c81405f2324aec29df809b4a.jpg) | Add to Reading ListSource URL: www.mat.uniroma2.itLanguage: English - Date: 2007-11-23 17:17:47
|
---|
2![Integer factorization, part 1: the Q sieve Integer factorization, part 2: detecting smoothness D. J. Bernstein Integer factorization, part 1: the Q sieve Integer factorization, part 2: detecting smoothness D. J. Bernstein](https://www.pdfsearch.io/img/a50d6493e6af5c9f48724e4c6e1de1cb.jpg) | Add to Reading ListSource URL: www.mat.uniroma2.itLanguage: English - Date: 2006-11-12 13:56:00
|
---|
3![FACTORIZATION TECHNIQUES ELVIS NUNEZ AND CHRIS SHAW Abstract. The security of the RSA public key cryptosystem relies upon the computational difficulty of deriving the factors of a particular semiprime modulus. In this pa FACTORIZATION TECHNIQUES ELVIS NUNEZ AND CHRIS SHAW Abstract. The security of the RSA public key cryptosystem relies upon the computational difficulty of deriving the factors of a particular semiprime modulus. In this pa](https://www.pdfsearch.io/img/8c21af4216404d4fb9c6a74d3f285ee5.jpg) | Add to Reading ListSource URL: davidlowryduda.comLanguage: English - Date: 2016-05-25 03:59:31
|
---|
4![POST-SIEVING ON GPUs Andrea Miele1, Joppe W. Bos2, Thorsten Kleinjung1, Arjen K. Lenstra1 1LACAL, POST-SIEVING ON GPUs Andrea Miele1, Joppe W. Bos2, Thorsten Kleinjung1, Arjen K. Lenstra1 1LACAL,](https://www.pdfsearch.io/img/7baee8e2371c34cf110c284ef8e06c96.jpg) | Add to Reading ListSource URL: caramba.loria.frLanguage: English - Date: 2016-06-13 15:37:34
|
---|
5![Integer Factorization and Computing Discrete Logarithms in Maple Aaron Bradford∗, Michael Monagan∗, Colin Percival∗ , , Department of Mathematics, Simon Fr Integer Factorization and Computing Discrete Logarithms in Maple Aaron Bradford∗, Michael Monagan∗, Colin Percival∗ , , Department of Mathematics, Simon Fr](https://www.pdfsearch.io/img/f43d0695817e03e69b4e1bbc7d1637d2.jpg) | Add to Reading ListSource URL: www.daemonology.netLanguage: English - Date: 2006-05-14 06:12:35
|
---|
6![Innovations in Computer ScienceIdeal Forms of Coppersmith’s Theorem and Guruswami-Sudan List Decoding Henry Cohn∗ Nadia Heninger? Microsoft Research New England, One Memorial Drive, Cambridge, MA 02142 Innovations in Computer ScienceIdeal Forms of Coppersmith’s Theorem and Guruswami-Sudan List Decoding Henry Cohn∗ Nadia Heninger? Microsoft Research New England, One Memorial Drive, Cambridge, MA 02142](https://www.pdfsearch.io/img/e42bd268c733d0d378a9103058c5efc8.jpg) | Add to Reading ListSource URL: conference.itcs.tsinghua.edu.cnLanguage: English - Date: 2010-12-15 03:49:23
|
---|
7![Square Root Algorithms for the Number Field Sieve Emmanuel Thomé INRIA Nancy, Villers-lès-Nancy, France Abstract. We review several methods for the square root step of the Square Root Algorithms for the Number Field Sieve Emmanuel Thomé INRIA Nancy, Villers-lès-Nancy, France Abstract. We review several methods for the square root step of the](https://www.pdfsearch.io/img/21536b97f4b7698094e8a4dfe27975b0.jpg) | Add to Reading ListSource URL: www.loria.frLanguage: English - Date: 2012-11-29 10:44:38
|
---|
8![A quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic Razvan Barbulescu1 , Pierrick Gaudry1 , Antoine Joux2,3 , and Emmanuel Thomé1 1 A quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic Razvan Barbulescu1 , Pierrick Gaudry1 , Antoine Joux2,3 , and Emmanuel Thomé1 1](https://www.pdfsearch.io/img/de07681edcd1013f11440fa9b77c8d0d.jpg) | Add to Reading ListSource URL: www.loria.frLanguage: English - Date: 2013-12-16 04:03:37
|
---|
9![A kilobit special number field sieve factorization Kazumaro Aoki1 , Jens Franke2 , Thorsten Kleinjung2 , Arjen K. Lenstra3 , and Dag Arne Osvik3 1 2 A kilobit special number field sieve factorization Kazumaro Aoki1 , Jens Franke2 , Thorsten Kleinjung2 , Arjen K. Lenstra3 , and Dag Arne Osvik3 1 2](https://www.pdfsearch.io/img/c06c8686461f45b026677615f018c2ec.jpg) | Add to Reading ListSource URL: eprint.iacr.orgLanguage: English - Date: 2007-05-31 05:26:07
|
---|
10![Faster deterministic integer factorisation David Harvey (joint work with Edgar Costa, NYU) University of New South Wales 25th October 2011 Faster deterministic integer factorisation David Harvey (joint work with Edgar Costa, NYU) University of New South Wales 25th October 2011](https://www.pdfsearch.io/img/a4fa911c58675ee2778e31a10b630776.jpg) | Add to Reading ListSource URL: web.maths.unsw.edu.auLanguage: English - Date: 2011-10-24 19:42:20
|
---|