François Morain

Daniel Augot, François Morain: Discrete logarithm computations over finite fields using Reed-Solomon codes. CoRR abs/1202.4361 (2012)

François Morain: Elliptic Curves for Primality Proving. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 411-412

Guillaume Hanrot, François Morain, Emmanuel Thomé (Eds.): Algorithmic Number Theory, 9th International Symposium, ANTS-IX, Nancy, France, July 19-23, 2010. Proceedings. Lecture Notes in Computer Science 6197, Springer 2010, isbn 978-3-642-14517-9

Alin Bostan, François Morain, Bruno Salvy, Éric Schost: Fast algorithms for computing isogenies between elliptic curves. Math. Comput. 77(263): 1755-1778 (2008)

François Morain: Implementing the asymptotically fast version of the elliptic curve primality proving algorithm. Math. Comput. 76(257): 493-505 (2007)

P. Mihailescu, François Morain, Éric Schost: Computing the eigenvalue in the Schoof-Elkies-Atkin algorithm using Abelian lifts. ISSAC 2007: 285-292

Pierrick Gaudry, François Morain: Fast algorithms for computing the eigenvalue in the Schoof-Elkies-Atkin algorithm. ISSAC 2006: 109-115

Alin Bostan, Bruno Salvy, François Morain, Éric Schost: Fast algorithms for computing isogenies between elliptic curves. CoRR abs/cs/0609020 (2006)

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)

François Morain: Elliptic Curves for Primality Proving. Encyclopedia of Cryptography and Security 2005

Jens Franke, Thorsten Kleinjung, François Morain, T. Wirth: Proving the Primality of Very Large Numbers with fastECPP. ANTS 2004: 194-207

Andreas Enge, François Morain: Fast Decomposition of Polynomials with Known Galois Group. AAECC 2003: 254-264

Andreas Enge, François Morain: Comparing Invariants for Class Fields of Imaginary Quadratic Fields. ANTS 2002: 252-266

Mireille Fouquet, François Morain: Isogeny Volcanoes and the SEA Algorithm. ANTS 2002: 276-291

Régis Dupont, Andreas Enge, François Morain: Building curves with arbitrary small MOV degree over finite prime fields. IACR Cryptology ePrint Archive 2002: 94 (2002)

Guillaume Hanrot, François Morain: Solvability by radicals from an algorithmic point of view. ISSAC 2001: 175-182

Reynald Lercier, François Morain: Computing isogenies between elliptic curves over F_pⁿ using Couveignes's algorithm. Math. Comput. 69(229): 351-370 (2000)

Stefania Cavallar, Bruce Dodson, Arjen K. Lenstra, Walter M. Lioen, Peter L. Montgomery, Brian Murphy, Herman J. J. 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

Iwan M. Duursma, Pierrick Gaudry, François Morain: Speeding up the Discrete Log Computation on Curves with Automorphisms. ASIACRYPT 1999: 103-121

François Morain: Primality Proving Using Elliptic Curves: An Update. ANTS 1998: 111-127

D. Guillaume, François Morain: Building pseudoprimes with a large number of prime factors. Appl. Algebra Eng. Commun. Comput. 7(4): 263-277 (1996)

Reynald Lercier, François Morain: Counting the Number of Points on Elliptic Curves over Finite Fields: Strategies and Performance. EUROCRYPT 1995: 79-94

Jean Marc Couveignes, François Morain: Schoof's algorithm and isogeny cycles. ANTS 1994: 43-58

François Morain: Easy Numbers for the Elliptic Curve Primality Proving Algorithm. ISSAC 1992: 263-268

François Morain: Building Elliptic Curves Modulo Large Primes. EUROCRYPT 1991: 328-336

François Morain: Distributed Primality Proving and the Primality of (2³⁵³⁹+1)/3. EUROCRYPT 1990: 110-123

François Morain: Atkin's Test: News From the Front. EUROCRYPT 1989: 626-635