| Elliptic curves for primality proving F Morain Encyclopedia of Cryptography and Security, 411-412, 2011 | 777* | 2011 |
| Elliptic curves and primality proving AOL Atkin, F Morain Mathematics of computation 61 (203), 29-68, 1993 | 777 | 1993 |
| Speeding up the computations on an elliptic curve using addition-subtraction chains F Morain, J Olivos RAIRO-Theoretical Informatics and Applications 24 (6), 531-543, 1990 | 435 | 1990 |
| Factorization of a 512-bit RSA modulus S Cavallar, B Dodson, AK Lenstra, W Lioen, PL Montgomery, B Murphy, ... International Conference on the Theory and Applications of Cryptographic …, 2000 | 260 | 2000 |
| Fast algorithms for computing isogenies between elliptic curves A Bostan, B Salvy, F Morain, LIX Éric Schost arXiv preprint cs/0609020, 2008 | 139 | 2008 |
| Fast algorithms for computing isogenies between elliptic curves A Bostan, F Morain, B Salvy, É Schost Mathematics of Computation 77 (263), 1755-1778, 2008 | 139 | 2008 |
| Building curves with arbitrary small MOV degree over finite prime fields R Dupont, A Enge, F Morain Journal of Cryptology 18 (2), 79-89, 2005 | 138 | 2005 |
| Isogeny volcanoes and the SEA algorithm M Fouquet, F Morain International Algorithmic Number Theory Symposium, 276-291, 2002 | 136 | 2002 |
| Speeding up the discrete log computation on curves with automorphisms I Duursma, P Gaudry, F Morain Asiacrypt 1716, 103-121, 1999 | 131 | 1999 |
| Counting the number of points on elliptic curves over finite fields: strategies and performances R Lercier, F Morain EUROCRYPT 95, 79-94, 1995 | 120 | 1995 |
| Calcul du nombre de points sur une courbe elliptique dans un corps fini: aspects algorithmiques F Morain J. Théor. Nombres Bordeaux 7 (1), 255-282, 1995 | 119 | 1995 |
| Building cyclic elliptic curves modulo large primes F Morain Advances in Cryptology—EUROCRYPT’91, 328-336, 1991 | 119 | 1991 |
| Finding suitable curves for the elliptic curve method of factorization AOL Atkin, F Morain Mathematics of Computation 60 (201), 399-405, 1993 | 103 | 1993 |
| Improving NFS for the discrete logarithm problem in non-prime finite fields R Barbulescu, P Gaudry, A Guillevic, F Morain Eurocrypt 2015-34th Annual International Conference on the Theory and …, 2015 | 99 | 2015 |
| Schoof's algorithm and isogeny cycles JM Couveignes, F Morain Algorithmic number theory, 43-58, 1994 | 97 | 1994 |
| Implementing the asymptotically fast version of the elliptic curve primality proving algorithm F Morain Mathematics of Computation 76 (257), 493-505, 2007 | 79 | 2007 |
| Primality proving using elliptic curves: an update F Morain Algorithmic number theory, 111-127, 1998 | 58 | 1998 |
| Comparing invariants for class fields of imaginary quadratic fields A Enge, F Morain International Algorithmic Number Theory Symposium, 252-266, 2002 | 57 | 2002 |
| Isogeny cycles an the Schoof-Elkies-Atkin algorithm JM Couveignes, L Dewaghe, F Morain LIX, 1996 | 55 | 1996 |
| Courbes elliptiques et tests de primalité F Morain Lyon 1, 1990 | 51 | 1990 |
