Cryptology ePrint Archive: Report 2012/443

Improved CRT Algorithm for Class Polynomials in Genus 2

Kristin Lauter and Damien Robert

Abstract: We present a generalization to genus~2 of the probabilistic algorithm of Sutherland for computing Hilbert class polynomials. The improvement over the Br{\"o}ker-Gruenewald-Lauter algorithm for the genus~2 case is that we do not need to find a curve in the isogeny class whose endomorphism ring is the maximal order; rather, we present a probabilistic algorithm for ``going up'' to a maximal curve (a curve with maximal endomorphism ring), once we find any curve in the right isogeny class. Then we use the structure of the Shimura class group and the computation of $(\ell,\ell)$-isogenies to compute all isogenous maximal curves from an initial one.

This is an extended version of the article published at ANTS~X.

Category / Keywords: Class polynomials, genus 2, CRT

Publication Info: Published at ANTS X

Date: received 4 Aug 2012, last revised 7 May 2013

Contact author: damien robert at inria fr

Available format(s): PDF | BibTeX Citation

Note: Add acknowledgements

Version: 20130507:112323 (All versions of this report)

Short URL:

Discussion forum: Show discussion | Start new discussion

[ Cryptology ePrint archive ]