pith. sign in

arxiv: 1305.4330 · v2 · pith:WRAVPP4Jnew · submitted 2013-05-19 · 💻 cs.CR · math.NT

Computing class polynomials for abelian surfaces

classification 💻 cs.CR math.NT
keywords classcomputingpolynomialsquasi-linearabelianalgorithmapproachapproximations
0
0 comments X
read the original 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 $\theta$- 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.