Computing Class Polynomials for Abelian Surfaces
DOI10.1080/10586458.2013.878675zbMath1293.11107arXiv1305.4330OpenAlexW2202985978MaRDI QIDQ2875530
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
theta functionscomplex multiplicationalgebraic number theory computationsapplications to coding theory and cryptographyabelian varieties of dimension \(>1\)
Abelian varieties of dimension (> 1) (11G10) Theta functions and abelian varieties (14K25) Algebraic number theory computations (11Y40) Complex multiplication and abelian varieties (14K22) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Related Items (9)
Cites Work
- Unnamed Item
- Unnamed Item
- Explicit CM theory for level 2-structures on abelian surfaces
- Explizite Bestimmung der Randflächen des Fundamentalbereiches der Modulgruppe zweiten Grades
- Computing Igusa class polynomials
- Fast evaluation of modular functions using Newton iterations and the AGM
- A $p$-adic algorithm to compute the Hilbert class polynomial
- The complexity of class polynomial computation via floating point approximations
- Modern Computer Arithmetic
- Fast Multiple-Precision Evaluation of Elementary Functions
- Fast Decomposition of Polynomials with Known Galois Group
- On Siegel Modular Forms of Genus Two
- Computing Hilbert Class Polynomials
- The 2-Adic CM Method for Genus 2 Curves with Application to Cryptography
This page was built for publication: Computing Class Polynomials for Abelian Surfaces