François Morain

Publication Activity (10 Years)

Years Active: 1989-2023
Publications (10 Years): 9

Top Topics

Stochastic Methods

Curve Evolution

Top Venues

IACR Cryptol. ePrint Arch.

LMS J. Comput. Math.

Publications

François Morain, Guénaël Renault, Benjamin Smith
Deterministic factoring with oracles. Appl. Algebra Eng. Commun. Comput. 34 (4) (2023)
François Morain
Implementing the Thull-Yap Algorithm for Computing Euclidean Remainder Sequences. ISSAC (2022)
François Morain, Guénaël Renault, Benjamin Smith
Deterministic factoring with oracles. CoRR (2018)
Laurent Grémy, Aurore Guillevic, François Morain, Emmanuel Thomé
. SAC (2017)
Aurore Guillevic, François Morain, Emmanuel Thomé
Solving discrete logarithms on a 170-bit MNT curve by pairing reduction. IACR Cryptol. ePrint Arch. 2016 (2016)
Razvan Barbulescu, Pierrick Gaudry, Aurore Guillevic, François Morain
Improving NFS for the discrete logarithm problem in non-prime finite fields. IACR Cryptol. ePrint Arch. 2016 (2016)
Aurore Guillevic, François Morain, Emmanuel Thomé
Solving discrete logarithms on a 170-bit MNT curve by pairing reduction. CoRR (2016)
Aurore Guillevic, François Morain, Emmanuel Thomé
Solving Discrete Logarithms on a 170-Bit MNT Curve by Pairing Reduction. SAC (2016)
François Morain, Charlotte Scribot, Benjamin Smith
Computing cardinalities of -curve reductions over finite fields. LMS J. Comput. Math. 19 (A) (2016)
Razvan Barbulescu, Pierrick Gaudry, Aurore Guillevic, François Morain
Improving NFS for the Discrete Logarithm Problem in Non-prime Finite Fields. EUROCRYPT (1) (2015)
Frédéric Grosshans, Thomas Lawson, François Morain, Benjamin Smith
Factoring Safe Semiprimes with a Single Quantum Query. CoRR (2015)
Razvan Barbulescu, Pierrick Gaudry, Aurore Guillevic, François Morain
Improvements to the number field sieve for non-prime finite fields. CoRR (2014)
Daniel Augot, François Morain
Discrete logarithm computations over finite fields using Reed-Solomon codes CoRR (2012)
Alin Bostan, François Morain, Bruno Salvy, Éric Schost
Fast algorithms for computing isogenies between elliptic curves. Math. Comput. 77 (263) (2008)
François Morain
Implementing the asymptotically fast version of the elliptic curve primality proving algorithm. Math. Comput. 76 (257) (2007)
P. Mihailescu, François Morain, Éric Schost
Computing the eigenvalue in the Schoof-Elkies-Atkin algorithm using Abelian lifts. ISSAC (2007)
Alin Bostan, Bruno Salvy, François Morain, Éric Schost
Fast algorithms for computing isogenies between elliptic curves CoRR (2006)
Pierrick Gaudry, François Morain
Fast algorithms for computing the eigenvalue in the Schoof-Elkies-Atkin algorithm. ISSAC (2006)
Régis Dupont, Andreas Enge, François Morain
Building Curves with Arbitrary Small MOV Degree over Finite Prime Fields. J. Cryptol. 18 (2) (2005)
Jens Franke, Thorsten Kleinjung, François Morain, T. Wirth
Proving the Primality of Very Large Numbers with fastECPP. ANTS (2004)
Andreas Enge, François Morain
Fast Decomposition of Polynomials with Known Galois Group. AAECC (2003)
Régis Dupont, Andreas Enge, François Morain
Building curves with arbitrary small MOV degree over finite prime fields. IACR Cryptol. ePrint Arch. 2002 (2002)
Mireille Fouquet, François Morain
Isogeny Volcanoes and the SEA Algorithm. ANTS (2002)
Andreas Enge, François Morain
Comparing Invariants for Class Fields of Imaginary Quadratic Fields. ANTS (2002)
Guillaume Hanrot, François Morain
Solvability by radicals from an algorithmic point of view. ISSAC (2001)
Reynald Lercier, François Morain
using Couveignes's algorithm. Math. Comput. 69 (229) (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)
Iwan M. Duursma, Pierrick Gaudry, François Morain
Speeding up the Discrete Log Computation on Curves with Automorphisms. ASIACRYPT (1999)
François Morain
Primality Proving Using Elliptic Curves: An Update. ANTS (1998)
D. Guillaume, François Morain
Building pseudoprimes with a large number of prime factors. Appl. Algebra Eng. Commun. Comput. 7 (4) (1996)
Reynald Lercier, François Morain
Counting the Number of Points on Elliptic Curves over Finite Fields: Strategies and Performance. EUROCRYPT (1995)
Jean Marc Couveignes, François Morain
Schoof's algorithm and isogeny cycles. ANTS (1994)
François Morain
Easy Numbers for the Elliptic Curve Primality Proving Algorithm. ISSAC (1992)
François Morain
Building Elliptic Curves Modulo Large Primes. EUROCRYPT (1991)
François Morain
+1)/3. EUROCRYPT (1990)
François Morain
Atkin's Test: News From the Front. EUROCRYPT (1989)