The complexity of class polynomial computation via floating point approximations

Andreas Enge 1, 2
1 TANC - Algorithmic number theory for cryptology
LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau], Inria Saclay - Ile de France
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. It runs in time $O (|D| \log^5 |D| \log \log |D|) = O (|D|^{1 + \epsilon}) = O ( h^{2 + \epsilon})$ for any $\epsilon > 0$, where $D$ is the CM discriminant and $h$ is the degree of the class polynomial. Another fast algorithm uses multipoint evaluation techniques known from symbolic computation; its asymptotic complexity is worse by a factor of $\log |D|$. 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.
Complete list of metadatas

https://hal.inria.fr/inria-00001040
Contributor : Andreas Enge <>
Submitted on : Tuesday, April 24, 2007 - 10:43:43 AM
Last modification on : Monday, May 20, 2019 - 2:30:25 PM
Long-term archiving on : Tuesday, September 21, 2010 - 1:26:36 PM

Files

class.pdf
Files produced by the author(s)

Identifiers

Citation

Andreas Enge. The complexity of class polynomial computation via floating point approximations. 2007. ⟨inria-00001040v2⟩

Share

Metrics

Record views

15

Files downloads

89