Computing Hilbert Class Polynomials

DOI10.1007/978-3-540-79456-1_19zbMath1205.11139arXiv0802.0979OpenAlexW1502237758WikidataQ64387957 ScholiaQ64387957MaRDI QIDQ5387605

Andreas Enge, Juliana V. Belding, Reinier Bröker, Kristin E. Lauter

Publication date: 27 May 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Polynomials in number theory (11C08) Algebraic number theory computations (11Y40) Other algebras and orders, and their zeta and (L)-functions (11R54)

Related Items (17)

Isogenous hyperelliptic and non-hyperelliptic Jacobians with maximal complex multiplication ⋮ Gross-Zagier type CM value formulas on \(X_0^\ast(p)\) ⋮ A quasi-linear time algorithm for computing modular polynomials in dimension 2 ⋮ Class polynomials for nonholomorphic modular functions ⋮ Constructing Picard curves with complex multiplication using the Chinese remainder theorem ⋮ Explicit computations in Iwasawa theory ⋮ Constructing elliptic curves over finite fields with prescribed torsion ⋮ Modular polynomials via isogeny volcanoes ⋮ Pairing the volcano ⋮ Accelerating the CM method ⋮ Choosing the correct elliptic curve in the CM method ⋮ Pairing-based algorithms for Jacobians of genus 2 curves with maximal endomorphism ring ⋮ Computing Hilbert class polynomials with the Chinese remainder theorem ⋮ Primes Dividing Invariants of CM Picard Curves ⋮ Modular Polynomials for Genus 2 ⋮ Computing Igusa class polynomials ⋮ Computing Class Polynomials for Abelian Surfaces

Cites Work

• Weber's class invariants revisited
• Counting points on elliptic curves over finite fields
• Constructing elliptic curves over finite fields using double eta-quotients
• Die Typen der Multiplikatorenringe elliptischer Funktionenkörper
• A $p$-adic algorithm to compute the Hilbert class polynomial
• The complexity of class polynomial computation via floating point approximations
• Elliptic Curves and Primality Proving
• Handbook of Elliptic and Hyperelliptic Curve Cryptography
• Abelian varieties over finite fields
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computing Hilbert Class Polynomials