Lenstra

Results: 153



#Item
121SMOOTH 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

Add to Reading List

Source URL: www.math.leidenuniv.nl

Language: English - Date: 2004-11-24 09:42:47
122Factorization 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 ,

Add to Reading List

Source URL: www.iai.uni-bonn.de

Language: English - Date: 2002-07-30 11:33:08
123Lecture 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:

Add to Reading List

Source URL: f3.tiera.ru

Language: English - Date: 2010-01-05 10:02:28
124Elliptic Curves, Group Schemes, and Mazur’s Theorem

Elliptic Curves, Group Schemes, and Mazur’s Theorem

Add to Reading List

Source URL: www.math.harvard.edu

Language: English - Date: 2004-06-09 06:37:35
125Proceedings of the International Congress of Mathematicians Berkeley, California, USA, 1986

Proceedings of the International Congress of Mathematicians Berkeley, California, USA, 1986

Add to Reading List

Source URL: www.mathunion.org

Language: English - Date: 2012-04-18 10:44:43
126are 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

Add to Reading List

Source URL: www.math.dartmouth.edu

Language: English - Date: 2006-08-14 10:52:24
127CONSTRUCTING ELLIPTIC CURVES OF PRESCRIBED ORDER  PROEFSCHRIFT

CONSTRUCTING ELLIPTIC CURVES OF PRESCRIBED ORDER PROEFSCHRIFT

Add to Reading List

Source URL: www.math.leidenuniv.nl

Language: English - Date: 2006-05-03 17:12:30
128New 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

Add to Reading List

Source URL: www.emis.de

Language: English - Date: 2003-07-25 11:22:00
129Factorization 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

Add to Reading List

Source URL: physics.fullerton.edu

Language: English - Date: 2013-11-22 18:19:02
130CONGRUENT 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

Add to Reading List

Source URL: arxiv.org

Language: English - Date: 2012-10-31 20:14:24