Computing Modular Polynomials
From MaRDI portal
Publication:5697474
DOI10.1112/S1461157000000954zbMath1119.11030arXivmath/0408051MaRDI QIDQ5697474
Denis Xavier Charles, Kristin E. Lauter
Publication date: 17 October 2005
Published in: LMS Journal of Computation and Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0408051
Number-theoretic algorithms; complexity (11Y16) Elliptic curves (14H52) Arithmetic aspects of modular and Shimura varieties (11G18) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Related Items
Modular polynomials via isogeny volcanoes ⋮ Better path-finding algorithms in LPS Ramanujan graphs ⋮ Computing modular polynomials in quasi-linear time ⋮ On Avoiding ZVP-Attacks Using Isogeny Volcanoes ⋮ An explicit height bound for the classical modular polynomial ⋮ Cryptographic hash functions from expander graphs ⋮ Computing modular polynomials and isogenies of rank two Drinfeld modules over finite fields
Cites Work
- Nonsingular plane cubic curves over finite fields
- Über die Entwicklungskoeffizienten der automorphen Formen
- The least quadratic non residue
- On Character Sums and Primitive Roots†
- On the coefficients of the transformation polynomials for the elliptic modular function
- On the coefficients of transformation polynomials for the modular function
- Fast construction of irreducible polynomials over finite fields
