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![Annales Univ. Sci. Budapest., Sect. Comp–27 PRIMALITY PROOFS WITH ELLIPTIC CURVES: HEURISTICS AND ANALYSIS Wieb Bosma, Eric Cator (Nijmegen, The Netherlands) Annales Univ. Sci. Budapest., Sect. Comp–27 PRIMALITY PROOFS WITH ELLIPTIC CURVES: HEURISTICS AND ANALYSIS Wieb Bosma, Eric Cator (Nijmegen, The Netherlands)](https://www.pdfsearch.io/img/81b69709688d46276210856ecf360581.jpg) | Add to Reading ListSource URL: www.math.ru.nlLanguage: English - Date: 2016-04-18 16:20:05
|
---|
3![Annals of Mathematics, ), Factoring integers with elliptic curves By H. W. LENSTRA, JR. Annals of Mathematics, ), Factoring integers with elliptic curves By H. W. LENSTRA, JR.](https://www.pdfsearch.io/img/8bd0b4e5ffd14f4c2690d8ed478b6ef8.jpg) | Add to Reading ListSource URL: www.mat.uniroma2.itLanguage: English - Date: 2008-11-09 06:36:38
|
---|
4![A Provably Secure Elliptic Curve Scheme with Fast Encryption David Galindo1 , Sebasti` a Mart´ın1 , Tsuyoshi Takagi2 and Jorge L. Villar1 1 A Provably Secure Elliptic Curve Scheme with Fast Encryption David Galindo1 , Sebasti` a Mart´ın1 , Tsuyoshi Takagi2 and Jorge L. Villar1 1](https://www.pdfsearch.io/img/1aa5452329374254ab80d7da29855b40.jpg) | Add to Reading ListSource URL: www.dgalindo.esLanguage: English - Date: 2007-11-26 10:35:53
|
---|
5![Edwards Curves and the ECM Factorisation Method Peter Birkner Eindhoven University of Technology The 12th Workshop on Elliptic Curve Cryptography Edwards Curves and the ECM Factorisation Method Peter Birkner Eindhoven University of Technology The 12th Workshop on Elliptic Curve Cryptography](https://www.pdfsearch.io/img/71e0e28544ab80c3e7e79f734639b4b4.jpg) | Add to Reading ListSource URL: www.hyperelliptic.orgLanguage: English - Date: 2008-09-27 14:59:29
|
---|
6![Primality proofs with elliptic curves: heuristics and analysis Wieb Bosma∗, Eric Cator†, Antal J´arai‡, Gy¨ongyv´er Kiss§ September 11, 2014 Abstract Primality proofs with elliptic curves: heuristics and analysis Wieb Bosma∗, Eric Cator†, Antal J´arai‡, Gy¨ongyv´er Kiss§ September 11, 2014 Abstract](https://www.pdfsearch.io/img/27153713b3b26c0ad0e2906f90c1275e.jpg) | Add to Reading ListSource URL: www.math.ru.nlLanguage: English - Date: 2014-09-11 16:04:20
|
---|
7![R. van Bommel Almost all hyperelliptic Jacobians have a bad semi-abelian prime Master’s thesis, 23 June 2014 Supervisor: dr. D. Holmes R. van Bommel Almost all hyperelliptic Jacobians have a bad semi-abelian prime Master’s thesis, 23 June 2014 Supervisor: dr. D. Holmes](https://www.pdfsearch.io/img/fac5c5341ea35aabef7f532c750d81d0.jpg) | Add to Reading ListSource URL: algant.euLanguage: English - Date: 2014-07-04 06:58:52
|
---|
8![draft-irtf-cfrg-curves-02 - Elliptic Curves for Security draft-irtf-cfrg-curves-02 - Elliptic Curves for Security](https://www.pdfsearch.io/img/994c9f11a761fb9e23045e1f9f6717c4.jpg) | Add to Reading ListSource URL: tools.ietf.orgLanguage: English - Date: 2015-06-15 16:32:44
|
---|
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
|
---|