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/2f0b721106b21f44e5e772530ff0665c.jpg) | Add to Reading ListSource URL: websites.math.leidenuniv.nlLanguage: English - Date: 2005-10-10 10:28:27
|
---|
2![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
|
---|
3![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
|
---|
4![Integer factorization, part 1: the Q sieve D. J. Bernstein
Sieving small integers using primes: Integer factorization, part 1: the Q sieve D. J. Bernstein
Sieving small integers using primes:](https://www.pdfsearch.io/img/18d22e6c85089781a06c61c842c15ebb.jpg) | Add to Reading ListSource URL: www.mat.uniroma2.itLanguage: English - Date: 2006-11-12 13:55:56
|
---|
5![The Million-Key Question—Investigating the Origins of RSA Public Keys Petr Švenda, Matúš Nemec, Peter Sekan, Rudolf Kvašňovský, David Formánek, David Komárek, and Vashek Matyáš, Masaryk University https://www The Million-Key Question—Investigating the Origins of RSA Public Keys Petr Švenda, Matúš Nemec, Peter Sekan, Rudolf Kvašňovský, David Formánek, David Komárek, and Vashek Matyáš, Masaryk University https://www](https://www.pdfsearch.io/img/a1a7df5b8a2cd45e3554c3c84df32262.jpg) | Add to Reading ListSource URL: www.usenix.orgLanguage: English - Date: 2016-08-10 03:08:02
|
---|
6![Implicit Factoring: On Polynomial Time Factoring Given Only an Implicit Hint ∗ Alexander May, Maike Ritzenhofen Horst Görtz Institute for IT-security Faculty of Mathematics Ruhr-University of Bochum, 44780 Bochum, Ger Implicit Factoring: On Polynomial Time Factoring Given Only an Implicit Hint ∗ Alexander May, Maike Ritzenhofen Horst Görtz Institute for IT-security Faculty of Mathematics Ruhr-University of Bochum, 44780 Bochum, Ger](https://www.pdfsearch.io/img/9103e599b1dd2531db786c135d4afd95.jpg) | Add to Reading ListSource URL: www.cits.rub.deLanguage: English - Date: 2015-08-28 10:30:32
|
---|
7![International Mathematical Olympiad Preliminary Selection Contest 2004 — Hong Kong Outline of Solutions Answers: International Mathematical Olympiad Preliminary Selection Contest 2004 — Hong Kong Outline of Solutions Answers:](https://www.pdfsearch.io/img/b1401a4fc8a464855d5cce6acf3b7141.jpg) | Add to Reading ListSource URL: web.hku.hkLanguage: English - Date: 2013-03-15 02:40:55
|
---|
8![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
|
---|
9![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
|
---|
10![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
|
---|