Modular polynomials via isogeny volcanoes
type: Item
instance of: scholarly article
title: Modular polynomials via isogeny volcanoes
zbMATH Open document ID: 1267.11125
DOI: 10.1090/S0025-5718-2011-02508-1
author: Reinier Bröker
author: Andrew V. Sutherland
author: Kristin Lauter
published in: Mathematics of Computation
publication date: 2012-04-26T00:00:00Z
full work available at URL: https://arxiv.org/abs/1001.0402
Mathematics Subject Classification ID: 11Y16
Mathematics Subject Classification ID: 11G15
Mathematics Subject Classification ID: 11G20
zbMATH DE Number: 6028405
describes a project that uses: Magma
describes a project that uses: SageMath
describes a project that uses: zn_poly
describes a project that uses: gmp
MaRDI profile type: Publication
arXiv ID: 1001.0402
cites work: Explicit Bounds for Primality Testing and Related Problems
cites work: Computing Hilbert Class Polynomials
cites work: Factoring Polynomials Over Large Finite Fields
cites work: Modular exponentiation via the explicit Chinese remainder theorem
cites work: Q4509193
cites work: Computing the endomorphism ring of an ordinary elliptic curve over a finite field
cites work: Q4265362
cites work: Fast algorithms for computing isogenies between elliptic curves
cites work: Constructing elliptic curves of prime order
cites work: A $p$-adic algorithm to compute the Hilbert class polynomial
cites work: An explicit height bound for the classical modular polynomial
cites work: Binary quadratic forms. An algorithmic approach
cites work: On the Security of Cryptosystems with Quadratic Decryption: The Nicest Cryptanalysis
cites work: Computing Modular Polynomials
cites work: Advanced Topics in Computional Number Theory
cites work: Handbook of Elliptic and Hyperelliptic Curve Cryptography
cites work: On the coefficients of the transformation polynomials for the elliptic modular function
cites work: Q4213383
cites work: The complexity of class polynomial computation via floating point approximations
cites work: Computing modular polynomials in quasi-linear time
cites work: Constructing elliptic curves over finite fields using double eta-quotients
cites work: Modular curves of composite level
cites work: Class Invariants by the CRT Method
cites work: Q4737492
cites work: Q4737234
cites work: Q3840187
cites work: Q5831393
cites work: Faster polynomial multiplication via multipoint Kronecker substitution
cites work: Über die Berechnung der Fourierkoeffizienten der Funktion j().
cites work: Q4650358
cites work: Computation of the modular equation
cites work: Q3890801
cites work: Q3708089
cites work: Q4135671
cites work: Q4723876
cites work: Q4847916
cites work: A Rigorous Time Bound for Factoring Integers
cites work: Computing the number of points on an elliptic curve over a finite field: algorithmic aspects
cites work: Q4254917
cites work: Fast multiplication of large numbers
cites work: Counting points on elliptic curves over finite fields
cites work: SAGE
cites work: Q3615924
cites work: Computing Hilbert class polynomials with the Chinese remainder theorem
cites work: Q5631239
cites work: Q4406533
cites work: Q5386130
description: scientific article; zbMATH DE number 6028405