François Morain

According to our database1, François Morain authored at least 33 papers between 1989 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2018
Deterministic factoring with oracles.
CoRR, 2018

2017
Computing Discrete Logarithms in 𝔽p6.
Proceedings of the Selected Areas in Cryptography - SAC 2017, 2017

2016
Solving discrete logarithms on a 170-bit MNT curve by pairing reduction.
IACR Cryptology ePrint Archive, 2016

Improving NFS for the discrete logarithm problem in non-prime finite fields.
IACR Cryptology ePrint Archive, 2016

Solving discrete logarithms on a 170-bit MNT curve by pairing reduction.
CoRR, 2016

Solving Discrete Logarithms on a 170-Bit MNT Curve by Pairing Reduction.
Proceedings of the Selected Areas in Cryptography - SAC 2016, 2016

2015
Factoring Safe Semiprimes with a Single Quantum Query.
CoRR, 2015

Improving NFS for the Discrete Logarithm Problem in Non-prime Finite Fields.
Proceedings of the Advances in Cryptology - EUROCRYPT 2015, 2015

2012
Discrete logarithm computations over finite fields using Reed-Solomon codes
CoRR, 2012

2011
Elliptic Curves for Primality Proving.
Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011

2008
Fast algorithms for computing isogenies between elliptic curves.
Math. Comput., 2008

2007
Implementing the asymptotically fast version of the elliptic curve primality proving algorithm.
Math. Comput., 2007

Computing the eigenvalue in the Schoof-Elkies-Atkin algorithm using Abelian lifts.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2007

2006
Fast algorithms for computing isogenies between elliptic curves
CoRR, 2006

Fast algorithms for computing the eigenvalue in the Schoof-Elkies-Atkin algorithm.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2006

2005
Building Curves with Arbitrary Small MOV Degree over Finite Prime Fields.
J. Cryptology, 2005

2004
Proving the Primality of Very Large Numbers with fastECPP.
Proceedings of the Algorithmic Number Theory, 6th International Symposium, 2004

2003
Fast Decomposition of Polynomials with Known Galois Group.
Proceedings of the Applied Algebra, 2003

2002
Building curves with arbitrary small MOV degree over finite prime fields.
IACR Cryptology ePrint Archive, 2002

Isogeny Volcanoes and the SEA Algorithm.
Proceedings of the Algorithmic Number Theory, 5th International Symposium, 2002

Comparing Invariants for Class Fields of Imaginary Quadratic Fields.
Proceedings of the Algorithmic Number Theory, 5th International Symposium, 2002

2001
Solvability by radicals from an algorithmic point of view.
Proceedings of the 2001 International Symposium on Symbolic and Algebraic Computation, 2001

2000
Computing isogenies between elliptic curves over Fpn using Couveignes's algorithm.
Math. Comput., 2000


1999
Speeding up the Discrete Log Computation on Curves with Automorphisms.
Proceedings of the Advances in Cryptology, 1999

1998
Primality Proving Using Elliptic Curves: An Update.
Proceedings of the Algorithmic Number Theory, Third International Symposium, 1998

1996
Building pseudoprimes with a large number of prime factors.
Appl. Algebra Eng. Commun. Comput., 1996

1995
Counting the Number of Points on Elliptic Curves over Finite Fields: Strategies and Performance.
Proceedings of the Advances in Cryptology, 1995

1994
Schoof's algorithm and isogeny cycles.
Proceedings of the Algorithmic Number Theory, First International Symposium, 1994

1992
Easy Numbers for the Elliptic Curve Primality Proving Algorithm.
Proceedings of the 1992 International Symposium on Symbolic and Algebraic Computation, 1992

1991
Building Elliptic Curves Modulo Large Primes.
Proceedings of the Advances in Cryptology, 1991

1990
Distributed Primality Proving and the Primality of (23539+1)/3.
Proceedings of the Advances in Cryptology, 1990

1989
Atkin's Test: News From the Front.
Proceedings of the Advances in Cryptology, 1989


  Loading...