We present and analyze two algorithms for computing the Hilbert class polynomial
. The first is a
-adic lifting algorithm for inert primes
in the order of discriminant
< 0. The second is an improved Chinese remainder algorithm which uses the class group action on CM-curves over finite fields. Our run time analysis gives tighter bounds for the complexity of all known algorithms for computing
, and we show that all methods have comparable run times.
Bitte loggen Sie sich ein, um Zugang zu diesem Inhalt zu erhalten