Computing endomorphism rings of supersingular elliptic curves and connections to pathfinding in isogeny graphs

Abstract

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((\log p{)}^2{p}^{1/2})$. The algorithm works by first finding two cycles of a certain form in the supersingular $\ell$-isogeny graph $G(p,\ell )$, generating an order $\Lambda \subseteq \mathrm{End}(E)$. Then all maximal orders containing $\Lambda$ 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^p$ in $G(p,\ell )$, answering a question in arXiv:1909.07779.

References in corpus (5)

• Computing the endomorphism ring of an ordinary elliptic curve over a finite field
• Expander graphs based on GRH with an application to elliptic curve cryptography
• An arithmetic intersection formula for denominators of Igusa class polynomials
• Adventures in Supersingularland
• On basic and Bass quaternion orders

Cited by in corpus (2)

• Adding Level Structure to Supersingular Elliptic Curve Isogeny Graphs
• Computing supersingular endomorphism rings using inseparable endomorphisms