2007 |
21 | EE | P. Mihailescu,
François Morain,
Éric Schost:
Computing the eigenvalue in the Schoof-Elkies-Atkin algorithm using Abelian lifts.
ISSAC 2007: 285-292 |
2006 |
20 | EE | Pierrick Gaudry,
François Morain:
Fast algorithms for computing the eigenvalue in the Schoof-Elkies-Atkin algorithm.
ISSAC 2006: 109-115 |
19 | EE | Alin Bostan,
Bruno Salvy,
François Morain,
Éric Schost:
Fast algorithms for computing isogenies between elliptic curves
CoRR abs/cs/0609020: (2006) |
2005 |
18 | EE | François Morain:
Elliptic Curves for Primality Proving.
Encyclopedia of Cryptography and Security 2005 |
17 | EE | Régis Dupont,
Andreas Enge,
François Morain:
Building Curves with Arbitrary Small MOV Degree over Finite Prime Fields.
J. Cryptology 18(2): 79-89 (2005) |
2004 |
16 | EE | Jens Franke,
Thorsten Kleinjung,
François Morain,
T. Wirth:
Proving the Primality of Very Large Numbers with fastECPP.
ANTS 2004: 194-207 |
2003 |
15 | EE | Andreas Enge,
François Morain:
Fast Decomposition of Polynomials with Known Galois Group.
AAECC 2003: 254-264 |
2002 |
14 | EE | Andreas Enge,
François Morain:
Comparing Invariants for Class Fields of Imaginary Quadratic Fields.
ANTS 2002: 252-266 |
13 | EE | Mireille Fouquet,
François Morain:
Isogeny Volcanoes and the SEA Algorithm.
ANTS 2002: 276-291 |
2001 |
12 | EE | Guillaume Hanrot,
François Morain:
Solvability by radicals from an algorithmic point of view.
ISSAC 2001: 175-182 |
2000 |
11 | EE | Stefania Cavallar,
Bruce Dodson,
Arjen K. Lenstra,
Walter M. Lioen,
Peter L. Montgomery,
Brian Murphy,
Herman te Riele,
Karen Aardal,
Jeff Gilchrist,
Gérard Guillerm,
Paul C. Leyland,
Joël Marchand,
François Morain,
Alec Muffett,
Chris Putnam,
Craig Putnam,
Paul Zimmermann:
Factorization of a 512-Bit RSA Modulus.
EUROCRYPT 2000: 1-18 |
10 | | Reynald Lercier,
François Morain:
Computing isogenies between elliptic curves over Fpn using Couveignes's algorithm.
Math. Comput. 69(229): 351-370 (2000) |
1999 |
9 | | Iwan M. Duursma,
Pierrick Gaudry,
François Morain:
Speeding up the Discrete Log Computation on Curves with Automorphisms.
ASIACRYPT 1999: 103-121 |
1998 |
8 | EE | François Morain:
Primality Proving Using Elliptic Curves: An Update.
ANTS 1998: 111-127 |
1996 |
7 | EE | D. Guillaume,
François Morain:
Building Psudoprimes with a Large Number of Prime Factors.
Appl. Algebra Eng. Commun. Comput. 7(4): 263-277 (1996) |
1995 |
6 | EE | Reynald Lercier,
François Morain:
Counting the Number of Points on Elliptic Curves over Finite Fields: Strategies and Performance.
EUROCRYPT 1995: 79-94 |
1994 |
5 | | Jean Marc Couveignes,
François Morain:
Schoof's algorithm and isogeny cycles.
ANTS 1994: 43-58 |
1992 |
4 | EE | François Morain:
Easy Numbers for the Elliptic Curve Primality Proving Algorithm.
ISSAC 1992: 263-268 |
1991 |
3 | EE | François Morain:
Building Elliptic Curves Modulo Large Primes.
EUROCRYPT 1991: 328-336 |
1990 |
2 | EE | François Morain:
Distributed Primality Proving and the Primality of (23539+1)/3.
EUROCRYPT 1990: 110-123 |
1989 |
1 | EE | François Morain:
Atkin's Test: News From the Front.
EUROCRYPT 1989: 626-635 |