The maximal-order containment bound for Bass orders
Let be a supersingular elliptic curve and let be a Bass order whose size is polynomial in . Fix an integer and assume that
Maximal-order containment conjecture. For every , the number of maximal orders containing is
The paper proves this bound when 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
- 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.