{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/computing-endomorphism-rings-of-supersingular","title":"Computing endomorphism rings of supersingular elliptic curves and connections to pathfinding in isogeny graphs","arxiv_id":"2004.11495","date":"2020-04-24","proceeding":null,"authors":["Kirsten Eisentraeger","Sean Hallgren","Chris Leonardi","Travis Morrison","Jennifer Park"],"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)^2p^{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 \\operatorname{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.","url_abs":"http://arxiv.org/abs/2004.11495v2","url_pdf":"http://arxiv.org/pdf/2004.11495v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"links_only","authors_date_abstract":"arXiv metadata, CC0 1.0 (https://info.arxiv.org/help/license), from the Kaggle arXiv metadata snapshot of 2026-09-12"},"code_links":[{"paper_slug":"computing-endomorphism-rings-of-supersingular","repo_url":"https://github.com/travismo/beyond-the-sea","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers"},"arxiv_metadata":null,"syntology_extracted_results":null}