Computing Hilbert Class Polynomials
From MaRDI portal
Publication:5387605
DOI10.1007/978-3-540-79456-1_19zbMath1205.11139arXiv0802.0979WikidataQ64387957 ScholiaQ64387957MaRDI QIDQ5387605
Andreas Enge, Kristin E. Lauter, Reinier Bröker, Juliana V. Belding
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
11C08: Polynomials in number theory
11Y40: Algebraic number theory computations
11R54: Other algebras and orders, and their zeta and (L)-functions
Related Items
Constructing elliptic curves over finite fields with prescribed torsion, Modular polynomials via isogeny volcanoes, Computing Hilbert class polynomials with the Chinese remainder theorem, Modular Polynomials for Genus 2, Choosing the correct elliptic curve in the CM method
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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