François Morain - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 30 from 30

2023

Deterministic factoring with oraclesFrançois Morain, Guénaël Renault, Benjamin Smith 0003. aaecc, 34(4):663-690, July 2023. [doi]

2022

Implementing the Thull-Yap Algorithm for Computing Euclidean Remainder SequencesFrançois Morain. issac 2022: 197-205 [doi]

2017

6Laurent Grémy, Aurore Guillevic, François Morain, Emmanuel Thomé. sacrypt 2018: 85-105 [doi]

2016

2015

Improving NFS for the Discrete Logarithm Problem in Non-prime Finite FieldsRazvan Barbulescu, Pierrick Gaudry, Aurore Guillevic, François Morain. eurocrypt 2015: 129-155 [doi]

2008

Fast algorithms for computing isogenies between elliptic curvesAlin Bostan, François Morain, Bruno Salvy, Éric Schost. moc, 77(263):1755-1778, 2008. [doi]

2007

Computing the eigenvalue in the Schoof-Elkies-Atkin algorithm using Abelian liftsP. Mihailescu, François Morain, Éric Schost. issac 2007: 285-292 [doi]

Implementing the asymptotically fast version of the elliptic curve primality proving algorithmFrançois Morain. moc, 76(257):493-505, 2007. [doi]

2006

Fast algorithms for computing the eigenvalue in the Schoof-Elkies-Atkin algorithmPierrick Gaudry, François Morain. issac 2006: 109-115 [doi]

2005

Building Curves with Arbitrary Small MOV Degree over Finite Prime FieldsRégis Dupont, Andreas Enge, François Morain. joc, 18(2):79-89, 2005. [doi]

2004

Proving the Primality of Very Large Numbers with fastECPPJens Franke, Thorsten Kleinjung, François Morain, T. Wirth. antsw 2004: 194-207 [doi]

2003

Fast Decomposition of Polynomials with Known Galois GroupAndreas Enge, François Morain. AAECC 2003: 254-264 [doi]

2002

Building curves with arbitrary small MOV degree over finite prime fieldsRégis Dupont, Andreas Enge, François Morain. iacr, 2002:94, 2002. [doi]

Comparing Invariants for Class Fields of Imaginary Quadratic FieldsAndreas Enge, François Morain. antsw 2002: 252-266 [doi]

Isogeny Volcanoes and the SEA AlgorithmMireille Fouquet, François Morain. antsw 2002: 276-291 [doi]

2001

Solvability by radicals from an algorithmic point of viewGuillaume Hanrot, François Morain. issac 2001: 175-182 [doi]

2000

1999

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

1998

Primality Proving Using Elliptic Curves: An UpdateFrançois Morain. antsw 1998: 111-127 [doi]

1996

Building Psudoprimes with a Large Number of Prime FactorsD. Guillaume, François Morain. aaecc, 7(4):263-277, 1996. [doi]

1995

Counting the Number of Points on Elliptic Curves over Finite Fields: Strategies and PerformanceReynald Lercier, François Morain. eurocrypt 1995: 79-94 [doi]

1994

Schoof s algorithm and isogeny cyclesJean Marc Couveignes, François Morain. antsw 1994: 43-58

1992

Easy Numbers for the Elliptic Curve Primality Proving AlgorithmFrançois Morain. issac 1992: 263-268 [doi]

1991

Building Elliptic Curves Modulo Large PrimesFrançois Morain. eurocrypt 1991: 328-336 [doi]

1990

Distributed Primality Proving and the Primality of (2:::3539:::+1)/3François Morain. eurocrypt 1990: 110-123 [doi]

1989

Atkin s Test: News From the FrontFrançois Morain. eurocrypt 1989: 626-635 [doi]

Sign in or sign up to see more results.

runs on WebDSL