François Morain

40 papers A* 5A 1B 5Misc 2Journal 17Unranked 7

Year	Rank	Type	Title / Venue / Authors
2023	J	`jnl`	Deterministic factoring with oracles. Appl. Algebra Eng. Commun. Comput. François Morain, Guénaël Renault, Benjamin Smith
2022	B	`conf`	Implementing the Thull-Yap Algorithm for Computing Euclidean Remainder Sequences. ISSAC François Morain
2018	J	`jnl`	Deterministic factoring with oracles. CoRR François Morain, Guénaël Renault, Benjamin Smith
2017	Misc	`conf`	Computing Discrete Logarithms in 𝔽 SAC Laurent Grémy, Aurore Guillevic, François Morain, Emmanuel Thomé
2016	J	`jnl`	Computing cardinalities of -curve reductions over finite fields. LMS J. Comput. Math. François Morain, Charlotte Scribot, Benjamin Smith
2016	J	`jnl`	Improving NFS for the discrete logarithm problem in non-prime finite fields. IACR Cryptol. ePrint Arch. Razvan Barbulescu, Pierrick Gaudry, Aurore Guillevic, François Morain
2016	Misc	`conf`	Solving Discrete Logarithms on a 170-Bit MNT Curve by Pairing Reduction. SAC Aurore Guillevic, François Morain, Emmanuel Thomé
2016	J	`jnl`	Solving discrete logarithms on a 170-bit MNT curve by pairing reduction. CoRR Aurore Guillevic, François Morain, Emmanuel Thomé
2016	J	`jnl`	Solving discrete logarithms on a 170-bit MNT curve by pairing reduction. IACR Cryptol. ePrint Arch. Aurore Guillevic, François Morain, Emmanuel Thomé
2015	J	`jnl`	Factoring Safe Semiprimes with a Single Quantum Query. CoRR Frédéric Grosshans, Thomas Lawson, François Morain, Benjamin Smith
2015	—	`conf`	Improving NFS for the Discrete Logarithm Problem in Non-prime Finite Fields. EUROCRYPT (1) Razvan Barbulescu, Pierrick Gaudry, Aurore Guillevic, François Morain
2014	J	`jnl`	Improvements to the number field sieve for non-prime finite fields. CoRR Razvan Barbulescu, Pierrick Gaudry, Aurore Guillevic, François Morain
2012	J	`jnl`	Discrete logarithm computations over finite fields using Reed-Solomon codes CoRR Daniel Augot, François Morain
2011	—	`ch.`	Elliptic Curves for Primality Proving. Encyclopedia of Cryptography and Security (2nd Ed.) François Morain
2010	—	`ed.`	Algorithmic Number Theory, 9th International Symposium, ANTS-IX, Nancy, France, July 19-23, 2010. Proceedings ANTS Guillaume Hanrot, François Morain, Emmanuel Thomé
2008	J	`jnl`	Fast algorithms for computing isogenies between elliptic curves. Math. Comput. Alin Bostan, François Morain, Bruno Salvy, Éric Schost
2007	B	`conf`	Computing the eigenvalue in the Schoof-Elkies-Atkin algorithm using Abelian lifts. ISSAC P. Mihailescu, François Morain, Éric Schost
2007	J	`jnl`	Implementing the asymptotically fast version of the elliptic curve primality proving algorithm. Math. Comput. François Morain
2006	J	`jnl`	Fast algorithms for computing isogenies between elliptic curves CoRR Alin Bostan, Bruno Salvy, François Morain, Éric Schost
2006	B	`conf`	Fast algorithms for computing the eigenvalue in the Schoof-Elkies-Atkin algorithm. ISSAC Pierrick Gaudry, François Morain
2005	J	`jnl`	Building Curves with Arbitrary Small MOV Degree over Finite Prime Fields. J. Cryptol. Régis Dupont, Andreas Enge, François Morain
2005	—	`ch.`	Elliptic Curves for Primality Proving. Encyclopedia of Cryptography and Security François Morain
2004	—	`conf`	Proving the Primality of Very Large Numbers with fastECPP. ANTS Jens Franke, Thorsten Kleinjung, François Morain, T. Wirth
2003	—	`conf`	Fast Decomposition of Polynomials with Known Galois Group. AAECC Andreas Enge, François Morain
2002	J	`jnl`	Building curves with arbitrary small MOV degree over finite prime fields. IACR Cryptol. ePrint Arch. Régis Dupont, Andreas Enge, François Morain
2002	—	`conf`	Comparing Invariants for Class Fields of Imaginary Quadratic Fields. ANTS Andreas Enge, François Morain
2002	—	`conf`	Isogeny Volcanoes and the SEA Algorithm. ANTS Mireille Fouquet, François Morain
2001	B	`conf`	Solvability by radicals from an algorithmic point of view. ISSAC Guillaume Hanrot, François Morain
2000	J	`jnl`	Computing isogenies between elliptic curves over F Math. Comput. Reynald Lercier, François Morain
2000	A*	`conf`	Factorization of a 512-Bit RSA Modulus. EUROCRYPT Stefania Cavallar, Bruce Dodson, Arjen K. Lenstra, Walter M. Lioen, Peter L. Montgomery, Brian Murphy, Herman J. J. te Riele, Karen I. Aardal, Jeff Gilchrist, Gérard Guillerm, Paul C. Leyland, Joël Marchand, François Morain, Alec Muffett, Chris Putnam, Craig Putnam, Paul Zimmermann
1999	A	`conf`	Speeding up the Discrete Log Computation on Curves with Automorphisms. ASIACRYPT Iwan M. Duursma, Pierrick Gaudry, François Morain
1998	—	`conf`	Primality Proving Using Elliptic Curves: An Update. ANTS François Morain
1996	J	`jnl`	Building pseudoprimes with a large number of prime factors. Appl. Algebra Eng. Commun. Comput. Dominique Guillaume, François Morain
1995	A*	`conf`	Counting the Number of Points on Elliptic Curves over Finite Fields: Strategies and Performance. EUROCRYPT Reynald Lercier, François Morain
1994	—	`conf`	Schoof's algorithm and isogeny cycles. ANTS Jean Marc Couveignes, François Morain
1992	B	`conf`	Easy Numbers for the Elliptic Curve Primality Proving Algorithm. ISSAC François Morain
1991	A*	`conf`	Building Elliptic Curves Modulo Large Primes. EUROCRYPT François Morain
1990	A*	`conf`	Distributed Primality Proving and the Primality of (2 EUROCRYPT François Morain
1990	J	`jnl`	Speeding up the computations on an elliptic curve using addition-subtraction chains. RAIRO Theor. Informatics Appl. François Morain, J. Olivos
1989	A*	`conf`	Atkin's Test: News From the Front. EUROCRYPT François Morain