3 citations · 3 across the 4 of their papers we have counts for
4 papers
Using Fricke modular polynomials to compute isogenies
François Morain
Let be an elliptic curve over a field and a prime. There exists an elliptic curve related to by an isogeny of degree…
Using the Charlap-Coley-Robbins polynomials for computing isogenies
François Morain
The SEA algorithm for computing the cardinality of elliptic curves over finite fields in many characteristic uses modular polynomials. These polynomials come into different flavors…
Computing the Charlap-Coley-Robbins modular polynomials
François Morain
Let be an elliptic curve over a field and a prime. There exists an elliptic curve related to by anisogeny (rational map that…
Discrete logarithm computations over finite fields using Reed-Solomon codes
Daniel Augot, François Morain
Cheng and Wan have related the decoding of Reed-Solomon codes to the computation of discrete logarithms over finite fields, with the aim of proving the hardness of their decoding.…