Computing Hilbert Class Polynomials
Langue
en
Communication dans un congrès avec actes
Ce document a été publié dans
ANTS-VIII - Eighth Algorithmic Number Theory Symposium, 2008-05-17, Banff. 2008, vol. 5011, p. 282-295
Springer-Verlag
Résumé en anglais
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 ...Lire la suite >
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.< Réduire
Mots clés en anglais
class polynomial
p-adic lifting
algorithm
complexity
Origine
Importé de halUnités de recherche