← All problems

The maximal-order containment bound for Bass orders

6 years old · traced to

Let EE be a supersingular elliptic curve and let Λ⊆End⁡(E)\Lambda\subseteq\operatorname{End}(E) be a Bass order whose size is polynomial in log⁡p\log p. Fix an integer k≥0k\geq 0 and assume that

discrd⁡(Λ)=O(pk).\operatorname{discrd}(\Lambda)=O(p^k).

Maximal-order containment conjecture. For every ϵ>0\epsilon>0, the number of maximal orders containing Λ\Lambda is

O(pϵ).O(p^{\epsilon}).

The paper proves this bound when discrd⁡(Λ)\operatorname{discrd}(\Lambda) is square-free and conjectures that it continues to hold without the square-free assumption, supporting a subpolynomial running time for the global step of the endomorphism-ring algorithm.

References
  1. Kirsten Eisentraeger, Sean Hallgren, Chris Leonardi, Travis Morrison and Jennifer Park, “Computing endomorphism rings of supersingular elliptic curves and connections to pathfinding in isogeny graphs”, arXiv:2004.11495 (2020).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.