Papers › Computing endomorphism rings of supersingular elliptic curves and connections to...
Computing endomorphism rings of supersingular elliptic curves and connections to pathfinding in isogeny graphs
Kirsten Eisentraeger, Sean Hallgren, Chris Leonardi, Travis Morrison, Jennifer Park
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.
Computing endomorphism rings of supersingular elliptic curves is an important problem in computational number theory, and it is also closely connected to the security of some of the recently proposed isogeny-based cryptosystems. In this paper we give a new algorithm for computing the endomorphism ring of a supersingular elliptic curve E that runs, under certain heuristics, in time O((logp)²p^(1/2)). The algorithm works by first finding two cycles of a certain form in the supersingular ℓ-isogeny graph G(p,ℓ), generating an order Λ⊆End(E). Then all maximal orders containing Λ are computed, extending work of Voight. The final step is to determine which of these maximal orders is the endomorphism ring. As part of the cycle finding algorithm, we give a lower bound on the set of all j-invariants j that are adjacent to jᵖ in G(p,ℓ), answering a question in arXiv:1909.07779.
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