Class Invariants by the CRT Method

DOI10.1007/978-3-642-14518-6_14zbMath1260.11083arXiv1001.3394OpenAlexW1483726862MaRDI QIDQ4931646

Andrew V. Sutherland, Andreas Enge

Publication date: 29 September 2010

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

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

zbMATH Keywords

Chinese remainder theoremclass invariants

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Curves over finite and local fields (11G20) Elliptic and modular units (11G16)

Related Items (19)

Gross-Zagier type CM value formulas on \(X_0^\ast(p)\) ⋮ Finding elliptic curves with a subgroup of prescribed size ⋮ A quasi-linear time algorithm for computing modular polynomials in dimension 2 ⋮ Heuristics on pairing-friendly abelian varieties ⋮ -adic images of Galois for elliptic curves over (and an appendix with John Voight) ⋮ A survey of elliptic curves for proof systems ⋮ Scalable zero knowledge via cycles of elliptic curves ⋮ Computational Number Theory, Past, Present, and Future ⋮ Class polynomials for nonholomorphic modular functions ⋮ There are at most finitely many singular moduli that are S-units ⋮ Modular invariants and isogenies ⋮ Constructing elliptic curves over finite fields with prescribed torsion ⋮ Modular polynomials via isogeny volcanoes ⋮ Computing classical modular forms ⋮ Isogeny graphs of ordinary abelian varieties ⋮ Accelerating the CM method ⋮ A $p$-adic algorithm to compute the Hilbert class polynomial ⋮ Modular polynomials on Hilbert surfaces ⋮ Generalized class polynomials

This page was built for publication: Class Invariants by the CRT Method