Open AccessA classification of ECM-friendly families of elliptic curves using modular curves
Author(s) -
Razvan Barbulescu,
Sudarshan Shinde
Publication year - 2021
Publication title -
mathematics of computation
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.95
H-Index - 103
eISSN - 1088-6842
pISSN - 0025-5718
DOI - 10.1090/mcom/3697
Subject(s) - elliptic curve , mathematics , algorithm , prime (order theory) , computer science , database , discrete mathematics , pure mathematics , combinatorics
In this work, we establish a link between the classification of ECM-friendly elliptic curves and Mazur’s program B, which consists in parameterizing all the families of elliptic curves with exceptional Galois image. Motivated by Barbulescu et al. [ANTS X–proceedings of the tenth algorithmic number theory symposium, Berkeley, CA, 2013], we say an elliptic curve is ECM-friendly if it does not have complex multiplication and if its Galois image is exceptional for some level. Building upon two recent works which treated the case of congruence subgroups of prime-power level which occur for infinitely many j j -invariants, we prove that there are exactly 1525 families of rational elliptic curves with distinct Galois images which are cartesian products of subgroups of prime-power level. This makes a complete list of rational families of ECM-friendly elliptic curves with cartesian Galois images, out of which less than 23 were known in the literature. We furthermore refine a heuristic of Montgomery to compare these families and conclude that the best 4 families which can be put in a = − 1 a=-1 twisted Edwards’ form are new.