The complexity of class polynomial computation via floating point approximations

Abstract

We analyse the complexity of computing class polynomials, that are an important ingredient for CM constructions of elliptic curves, via complex floating point approximations of their roots. The heart of the algorithm is the evaluation of modular functions in several arguments. The fastest one of the presented approaches uses a technique devised by Dupont to evaluate modular functions by Newton iterations on an expression involving the arithmetic-geometric mean. Under the heuristic assumption, justified by experiments, that the correctness of the result is not perturbed by rounding errors, the algorithm runs in time $\displaystyle O \left( \sqrt {\vert D\vert} \log^3 \vert D\vert \, M \left( \sq... ...arepsilon} \vert D\vert \right) \subseteq O \left( h^{2 + \varepsilon} \right) $ for any $ \varepsilon > 0$, where $ D$ is the CM discriminant, $ h$ is the degree of the class polynomial and $ M (n)$ is the time needed to multiply two $ n$-bit numbers. Up to logarithmic factors, this running time matches the size of the constructed polynomials. The estimate also relies on a new result concerning the complexity of enumerating the class group of an imaginary quadratic order and on a rigorously proven upper bound for the height of class polynomials.