5 citations · 11 across the 5 of their papers we have counts for
Showing 2004Show all
2 papers · 1 filter
math.NT2004★ 3 cited
Complex Multiplication Tests for Elliptic Curves
Denis Charles
We consider the problem of checking whether an elliptic curve defined over a given number field has complex multiplication. We study two polynomial time algorithms for this problem…
math.NT2004★ 1 cited
Computing Modular Polynomials
Denis Charles, Kristin Lauter
We present a new probabilistic algorithm to compute modular polynomials modulo a prime. Modular polynomials parameterize pairs of isogenous elliptic curves and are useful in many a…