121![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 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](https://www.pdfsearch.io/img/4a7d7be1cf0655944e4e372269b5a957.jpg) | Add to Reading ListSource URL: www.math.leidenuniv.nlLanguage: English - Date: 2004-11-24 09:42:47
|
---|
122![Factorization of a 512–Bit RSA Modulus Stefania Cavallar3, Bruce Dodson8 , Arjen K. Lenstra1 , Walter Lioen3 , Peter L. Montgomery10 , Brian Murphy2 , Herman te Riele3 , Karen Aardal13 , Factorization of a 512–Bit RSA Modulus Stefania Cavallar3, Bruce Dodson8 , Arjen K. Lenstra1 , Walter Lioen3 , Peter L. Montgomery10 , Brian Murphy2 , Herman te Riele3 , Karen Aardal13 ,](https://www.pdfsearch.io/img/98e5eec19ad0f3af63fce0339c220bc9.jpg) | Add to Reading ListSource URL: www.iai.uni-bonn.deLanguage: English - Date: 2002-07-30 11:33:08
|
---|
123![Lecture Notes in Computer Science Commenced Publication in 1973 Founding and Former Series Editors: Lecture Notes in Computer Science Commenced Publication in 1973 Founding and Former Series Editors:](https://www.pdfsearch.io/img/43f11c1cd7b70b4e5297319a0c13860d.jpg) | Add to Reading ListSource URL: f3.tiera.ruLanguage: English - Date: 2010-01-05 10:02:28
|
---|
124![Elliptic Curves, Group Schemes, and Mazur’s Theorem Elliptic Curves, Group Schemes, and Mazur’s Theorem](https://www.pdfsearch.io/img/275d6d95ffabc7cb8328f05d06832373.jpg) | Add to Reading ListSource URL: www.math.harvard.eduLanguage: English - Date: 2004-06-09 06:37:35
|
---|
125![Proceedings of the International Congress of Mathematicians Berkeley, California, USA, 1986 Proceedings of the International Congress of Mathematicians Berkeley, California, USA, 1986](https://www.pdfsearch.io/img/e9aad23a7d20820761bd23a014ebff11.jpg) | Add to Reading ListSource URL: www.mathunion.orgLanguage: English - Date: 2012-04-18 10:44:43
|
---|
126![are so laborious and difficult that even for numbers that do not exceed the limits of tables constructed by estimable men, they try the patience of even the practiced calculator. And these methods do not apply at are so laborious and difficult that even for numbers that do not exceed the limits of tables constructed by estimable men, they try the patience of even the practiced calculator. And these methods do not apply at](https://www.pdfsearch.io/img/a28ef27a54e6b5c45ee91eaf1696bd2e.jpg) | Add to Reading ListSource URL: www.math.dartmouth.eduLanguage: English - Date: 2006-08-14 10:52:24
|
---|
127![CONSTRUCTING ELLIPTIC CURVES OF PRESCRIBED ORDER PROEFSCHRIFT CONSTRUCTING ELLIPTIC CURVES OF PRESCRIBED ORDER PROEFSCHRIFT](https://www.pdfsearch.io/img/159a7d76fadd1e3626c5a28323758047.jpg) | Add to Reading ListSource URL: www.math.leidenuniv.nlLanguage: English - Date: 2006-05-03 17:12:30
|
---|
128![New Computations Concerning the Cohen-Lenstra Heuristics Herman te Riele and Hugh Williams New Computations Concerning the Cohen-Lenstra Heuristics Herman te Riele and Hugh Williams](https://www.pdfsearch.io/img/eaa24509c85bfc1a1cb9f8304434c001.jpg) | Add to Reading ListSource URL: www.emis.deLanguage: English - Date: 2003-07-25 11:22:00
|
---|
129![Factorization of a 1061-bit number by the Special Number Field Sieve Greg Childers Factorization of a 1061-bit number by the Special Number Field Sieve Greg Childers](https://www.pdfsearch.io/img/f26dc421cc53350c3469365308275c4d.jpg) | Add to Reading ListSource URL: physics.fullerton.eduLanguage: English - Date: 2013-11-22 18:19:02
|
---|
130![CONGRUENT NUMBERS AND HEEGNER POINTS arXiv:1210.8231v1 [math.NT] 31 Oct 2012 CONGRUENT NUMBERS AND HEEGNER POINTS arXiv:1210.8231v1 [math.NT] 31 Oct 2012](https://www.pdfsearch.io/img/573099283cad24cea26728be5e702fd6.jpg) | Add to Reading ListSource URL: arxiv.orgLanguage: English - Date: 2012-10-31 20:14:24
|
---|