Computing Hilbert Class Polynomials
Idioma
en
Communication dans un congrès avec actes
Este ítem está publicado en
ANTS-VIII - Eighth Algorithmic Number Theory Symposium, 2008-05-17, Banff. 2008, vol. 5011, p. 282-295
Springer-Verlag
Resumen en inglés
We present and analyze two algorithms for computing the Hilbert class polynomial $H_D$ . The first is a p-adic lifting algorithm for inert primes p in the order of discriminant D < 0. The second is an improved Chinese ...Leer más >
We present and analyze two algorithms for computing the Hilbert class polynomial $H_D$ . The first is a p-adic lifting algorithm for inert primes p in the order of discriminant D < 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 $H_D$ , and we show that all methods have comparable run times.< Leer menos
Palabras clave en inglés
class polynomial
p-adic lifting
algorithm
complexity
Orígen
Importado de HalCentros de investigación