[Resource Topic] 2012/443: Improved CRT Algorithm for Class Polynomials in Genus 2

Welcome to the resource topic for 2012/443

Title:
Improved CRT Algorithm for Class Polynomials in Genus 2

Authors: Kristin Lauter, 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ö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.

ePrint: https://eprint.iacr.org/2012/443

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .