Improved CRT algorithm for class polynomials in genus 2

MaRDI QIDQ2949507zbMATH OpenFDO

Authors Damien Robert, Kristin Lauter

Publication date 1 October 2015

Full work available at URL http://msp.org/obs/2013/1-1/p22.xhtml

zbMATH Keywords

class field polynomialsCRThyperelliptic curve cryptographyisogenies

Mathematics Subject Classification ID

Complex multiplication and moduli of abelian varieties (11G15) Number-theoretic algorithms; complexity (11Y16) Applications to coding theory and cryptography of arithmetic geometry (14G50) Complex multiplication and abelian varieties (14K22) Cryptography (94A60)

Recommendations

• Computing Igusa class polynomials
• Constructing elliptic curves and curves of genus 2 over finite fields
• Computing class polynomials for abelian surfaces
• Hilbert modular polynomials
• Computing Hilbert Class Polynomials

Cited in

(7)

• Computing Igusa class polynomials
• Computing class polynomials for abelian surfaces
• Computing Humbert surfaces and applications
• Class invariants by the CRT method
• Cyclic isogenies for abelian varieties with real multiplication
• Constructing Picard curves with complex multiplication using the Chinese remainder theorem
• Modular polynomials on Hilbert surfaces

This page was built for publication: Improved CRT algorithm for class polynomials in genus 2

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2949507)