arXiv · 2301.11169
Computing the endomorphism ring of an elliptic curve over a number field
Abstract
We describe deterministic and probabilistic algorithms to determine whether or not a given monic irreducible polynomial H in Z[X] is a Hilbert class polynomial, and if so, which one. These algorithms can be used to determine whether a given algebraic integer is the j-invariant of an elliptic curve with complex multiplication (CM), and if so, the associated CM discriminant. More generally, given an elliptic curve E over a number field, one can use them to compute the endomorphism ring of E. Our algorithms admit simple implementations that are asymptotically and practically faster than existing approaches.
Explore related subjects
Keep this discovery
John E. Cremona, Andrew V. Sutherland. 2023-01-26. Computing the endomorphism ring of an elliptic curve over a number field. https://doi.org/10.1090/conm%2F796%2F15998
Cite the original work for its findings. Save a collection to share your selection of sources.