2023/02/10 by François Morain, Morain, François
Computer Science · Mathematics · #Cryptography and Residue Arithmetic #Polynomial and algebraic computation #Analytic Number Theory Research
paper · pdf · doi:10.48550/arxiv.2302.05217
Let E be an elliptic curve over a field K and ℓ a prime. There exists an elliptic curve E^* related to E by anisogeny (rational map that is also a group homomorphisms) of degree ℓ if and only Φ_ℓ(X, j(E)) = 0, where Φ_ℓ(X, Y) is the traditional modular polynomial. Moreover, the modular polynomial gives the coefficients of E^*, together with parameters needed to build the isogeny explicitly. Since the traditional modular polynomial has large coefficients, many families with smaller coefficients can be used instead, as described by Elkies, Atkin and others. In this work, we concentrate on the computation of the family of modular polynomials introduced by Charlap, Coley and Robbins. It has the advantage of giving directly the coefficients of E^* as roots of these polynomials. We review and adapt the known algorithms to perform the computations of modular polynomials. After describing the use of series computations, we investigate fast algorithms using floating point numbers based on fast numerical evaluation of Eisenstein series. We also explain how to use isogeny volcanoes as an alternative.