Paper 2014/230

Isogeny graphs with maximal real multiplication

Sorina Ionica and Emmanuel Thomé


An isogeny graph is a graph whose vertices are principally polarizable abelian varieties and whose edges are isogenies between these varieties. In his thesis, Kohel describes the structure of isogeny graphs for elliptic curves and shows that one may compute the endomorphism ring of an elliptic curve defined over a finite field by using a depth-first search (DFS) 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. In this article, we show that, under certain circumstances, the problem of determining the endomorphism ring can also be solved in genus 2 with a DFS-based algorithm. We consider the case of genus-2 Jacobians with complex multiplication, with the assumptions that the real multiplication subring is maximal and has class number one. We describe the isogeny graphs in that case, locally at prime numbers which split in the real multiplication subfield. The resulting algorithm is implemented over finite fields, and examples are provided. To the best of our knowledge, this is the first DFS-based algorithm in genus 2.

Available format(s)
Publication info
Preprint. MINOR revision.
isogeny graphsabelian varietiesgenus 2
Contact author(s)
sorina ionica @ m4x org
2016-10-17: last of 3 revisions
2014-04-01: received
See all versions
Short URL
Creative Commons Attribution


      author = {Sorina Ionica and Emmanuel Thomé},
      title = {Isogeny graphs with maximal real multiplication},
      howpublished = {Cryptology ePrint Archive, Paper 2014/230},
      year = {2014},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.