Computing class polynomials for abelian surfaces

DOI10.1080/10586458.2013.878675MaRDI QIDQ2875530zbMATH OpenOpenAlexFDO

Authors Andreas Enge, Emmanuel Thomé

Publication date 8 August 2014

Published in Experimental Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1305.4330

zbMATH Keywords

abelian varieties of dimension \(>1\)algebraic number theory computationsapplications to coding theory and cryptographycomplex multiplicationtheta functions

Mathematics Subject Classification ID

Abelian varieties of dimension (> 1) (11G10) Algebraic number theory computations (11Y40) Applications to coding theory and cryptography of arithmetic geometry (14G50) Complex multiplication and abelian varieties (14K22) Theta functions and abelian varieties (14K25)

Abstract: We describe a quasi-linear algorithm for computing Igusa class polynomials of Jacobians of genus 2 curves via complex floating-point approximations of their roots. After providing an explicit treatment of the computations in quartic CM fields and their Galois closures, we pursue an approach due to Dupont for evaluating $heta$- constants in quasi-linear time using Newton iterations on the Borchardt mean. We report on experiments with our implementation and present an example with class number 17608.

Recommendations

• Computing Igusa class polynomials
• The complexity of class polynomial computation via floating point approximations
• Improved CRT algorithm for class polynomials in genus 2
• Genus 2 curves with complex multiplication
• Computing (\ell ,\ell )-isogenies in polynomial time on Jacobians of genus 2 curves

Cites work

• A p-adic algorithm to compute the Hilbert class polynomial
• Computing Hilbert Class Polynomials
• Computing Igusa class polynomials
• Explicit CM theory for level 2-structures on abelian surfaces
• Explizite Bestimmung der Randflächen des Fundamentalbereiches der Modulgruppe zweiten Grades
• Fast Decomposition of Polynomials with Known Galois Group
• Fast evaluation of modular functions using Newton iterations and the AGM
• Fast Multiple-Precision Evaluation of Elementary Functions
• scientific article; zbMATH DE number 870534 (Why is no real title available?)
• Modern computer algebra
• Modern computer arithmetic
• On Siegel Modular Forms of Genus Two
• The 2-Adic CM Method for Genus 2 Curves with Application to Cryptography
• The complexity of class polynomial computation via floating point approximations

Cited in

(18)

• Computing the Abel map
• Computing Igusa class polynomials
• Improved CRT algorithm for class polynomials in genus 2
• Computing theta functions in quasi-linear time in genus two and above
• Denominators of Igusa class polynomials
• The complexity of class polynomial computation via floating point approximations
• Computing Humbert surfaces and applications
• A quasi-linear time algorithm for computing modular polynomials in dimension 2
• Computing Jacobi's theta in quasi-linear time
• Isogenous hyperelliptic and non-hyperelliptic Jacobians with maximal complex multiplication
• The divisor classes of the surface \(z^ p=G(x,y)\), a programmable problem
• Genus 3 hyperelliptic curves with CM via Shimura reciprocity
• Certified Newton schemes for the evaluation of low-genus theta functions
• Computing isogeny classes of typical principally polarized abelian surfaces over the rationals
• Isogeny graphs of ordinary abelian varieties
• Schertz style class invariants for higher degree CM fields
• Modular polynomials on Hilbert surfaces
• Hilbert theta series and invariants of genus 2 curves

This page was built for publication: Computing class polynomials for abelian surfaces

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