Isogeny graphs with maximal real multiplication - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2015

Isogeny graphs with maximal real multiplication

Résumé

An isogeny graph is a graph whose vertices are principally polarized abelian varieties and whose edges are isogenies between these varieties. In his thesis, Kohel described the structure of isogeny graphs for elliptic curves and showed that one may compute the endomorphism ring of an elliptic curve defined over a finite field by using a depth first search algorithm in the graph. In dimension 2, the structure of isogeny graphs is less understood and existing algorithms for computing endomorphism rings are very expensive. Our setting considers genus 2 jacobians with complex multiplication, with the assumptions that the real multiplication subring is maximal and has class number one. We fully describe the isogeny graphs in that case. Over finite fields, we derive a depth first search algorithm for computing endomorphism rings locally at prime numbers, if the real multiplication is maximal. To the best of our knowledge, this is the first DFS-based algorithm in genus 2.
Fichier principal
Vignette du fichier
draft.pdf (830.27 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-00967742 , version 1 (23-07-2014)
hal-00967742 , version 2 (19-06-2015)
hal-00967742 , version 3 (17-10-2016)
hal-00967742 , version 4 (23-02-2018)
hal-00967742 , version 5 (16-02-2019)

Identifiants

Citer

Sorina Ionica, Emmanuel Thomé. Isogeny graphs with maximal real multiplication. 2015. ⟨hal-00967742v3⟩
1086 Consultations
468 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More