92 citations · 1.1k across the 51 of their papers we have counts for
Showing 2009Show all
3 papers · 1 filter
math.NT2009★ 11 cited
An explicit height bound for the classical modular polynomial
Reinier Broker, Andrew V. Sutherland
For a prime m, let Phi_m be the classical modular polynomial, and let h(Phi_m) denote its logarithmic height. By specializing a theorem of Cohen, we prove that h(Phi_m) <= 6 m log…
math.NT2009★ 66 cited
Computing the endomorphism ring of an ordinary elliptic curve over a finite field
Gaetan Bisson, Andrew V. Sutherland
We present two algorithms to compute the endomorphism ring of an ordinary elliptic curve E defined over a finite field F_q. Under suitable heuristic assumptions, both have subexpon…
math.NT2009★ 61 cited
Computing Hilbert class polynomials with the Chinese Remainder Theorem
Andrew V. Sutherland
We present a space-efficient algorithm to compute the Hilbert class polynomial H_D(X) modulo a positive integer P, based on an explicit form of the Chinese Remainder Theorem. Under…