arXiv · 1101.4323
Computing endomorphism rings of elliptic curves under the GRH
Abstract
We design a probabilistic algorithm for computing endomorphism rings of ordinary elliptic curves defined over finite fields that we prove has a subexponential runtime in the size of the base field, assuming solely the generalized Riemann hypothesis. Additionally, we improve the asymptotic complexity of previously known, heuristic, subexponential methods by describing a faster isogeny-computing routine.
Explore related subjects
Keep this discovery
Gaetan Bisson. 2011-02-14. Computing endomorphism rings of elliptic curves under the GRH. https://doi.org/10.1515/jmc.2011.008
Cite the original work for its findings. Save a collection to share your selection of sources.