Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Morain, François - Laboratoire d'Informatique, École Polytechnique
PRIME VALUES OF PARTITION NUMBERS AND THE PRIMALITY OF p 1840926
On Cornacchia's algorithm for solving the diophantine equation
Counting the number of points on elliptic curves over finite fields
Easy numbers for the Elliptic Curve Primality Proving Algorithm
ALGORITHMS FOR COMPUTING ISOGENIES BETWEEN ELLIPTIC R. LERCIER AND F. MORAIN
BUILDING PSEUDOPRIMES WITH A LARGE NUMBER OF PRIME FACTORS
ETEMENTS DE COURBES ELLIPTIQUES ` A MULTIPLICATION
COUNTING POINTS ON ELLIPTIC CURVES OVER F p n USING COUVEIGNES'S ALGORITHM
Isogeny volcanoes and the SEA algorithm M. Fouquet and F. Morain ?
SUR LES SOMMES DE CARACT ` COURBES ELLIPTIQUES `
PRIMALITY PROVING USING ELLIPTIC CURVES: AN UPDATE Abstract. In 1986, following the work of Schoof on point counting on elliptic curves over
Article Submitted to Journal of Symbolic Computation Solvability by radicals from a practical point of
POLYTECHNIQUE LABORATOIRE D'INFORMATIQUE
Easy numbers for the Elliptic Curve Primality Proving Algorithm
