Computation of Hilbert class polynomials and modular polynomials from supersingular elliptic curves - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2023

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

Résumé

We present several new heuristic algorithms to compute class polynomials and modular polynomials modulo a prime p by revisiting 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, the recent advances in the study of supersingular curves through the Deuring correspondence motivated by isogeny-based cryptography has provided all the tools to perform the necessary tasks efficiently. 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. The first one is derived easily from the existing tools of isogeny-based cryptography, while the second introduces new ideas to perform that task efficiently for a big number of maximal orders at the same time. For each of the polynomials (Hilbert and modular), we obtain two algorithms. The first one, that we will qualify as direct, is based on the computation of a set of well-chosen supersingular j-invariants defined over F p 2 and uses the aforementioned algorithm to translate maximal orders to j-invariants as its main building block. The second one is a CRT algorithm that applies the direct algorithm on a set of small primes and reconstruct the result modulo p with the chinese remainder theorem. In both cases, the direct algorithm achieves the best known complexity for primes p that are relatively small compared to the discriminant (for the Hilbert case) and to the level (for the modular case). Our CRT algorithms matches the complexities of the state-of-the-art CRT approach based on ordinary curves, while improving some of the steps, thus opening the possibility to a better practical efficiency.
Fichier principal
Vignette du fichier
2301.08531.pdf (426.74 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04389884 , version 1 (12-01-2024)

Identifiants

Citer

Antonin Leroux. Computation of Hilbert class polynomials and modular polynomials from supersingular elliptic curves. 2023. ⟨hal-04389884⟩
3 Consultations
5 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More