English

Using Fricke modular polynomials to compute isogenies

Number Theory 2024-02-15 v1

Abstract

Let E\mathcal{E} be an elliptic curve over a field K\mathbf{K} and \ell a prime. There exists an elliptic curve E\mathcal{E}^* related to E\mathcal{E} by an isogeny of degree \ell only if Φt(X,j(E))=0\Phi_\ell^t(X, j(\mathcal{E})) = 0, where Φt(X,Y)\Phi_\ell^t(X, Y) is the traditional modular polynomial. Moreover, Φt\Phi_\ell^t gives the coefficients of E\mathcal{E}^*, together with parameters needed to build the isogeny explicitly. Since Φt\Phi_\ell^t has very 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 Fricke and more recently used by Charlap, Coley and Robbins. In some cases, the resulting polynomials are small, which justifies the interest of this study. We review and adapt the known algorithms to perform the computations of these 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. The last part is concerned with finding explicit formulas for computing the coefficients of E\mathcal{E}^*. To this we add tables of numerical examples.

Keywords

Cite

@article{arxiv.2402.09027,
  title  = {Using Fricke modular polynomials to compute isogenies},
  author = {François Morain},
  journal= {arXiv preprint arXiv:2402.09027},
  year   = {2024}
}

Comments

arXiv admin note: substantial text overlap with arXiv:2302.05217

R2 v1 2026-06-28T14:48:13.117Z