Papers › Computing the endomorphism ring of an elliptic curve over a number field
Computing the endomorphism ring of an elliptic curve over a number field
John E. Cremona, Andrew V. Sutherland
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
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.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections