Computation of Hilbert class polynomials and modular polynomials from supersingular elliptic curves

arXiv2301.08531MaRDI QIDQ6423931FDOQ6423931

Publication date: 20 January 2023

Abstract: We present several new heuristic algorithms to compute class polynomials and modular polynomials modulo a prime

P

. For that, we revisit the idea of working with supersingular elliptic curves. The best known algorithms to this date are based on ordinary curves, due to the supposed inefficiency of the supersingular case. While this was true a decade ago, it is not anymore due to the recent advances in the study of supersingular curves. Our main ingredients are two new heuristic algorithms to compute the

j

-invariants of supersingular curves having an endomorphism ring contained in some set of isomorphism class of maximal orders.

This page was built for publication: Computation of Hilbert class polynomials and modular polynomials from supersingular elliptic curves

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6423931)