Computing Hilbert Class Polynomials

Details Computing Hilbert Class Polynomials Computing Hilbert Class Polynomials

2008-02-07

arxiv.org/abs/0802.0979v1

Dans ANTS-VIII - Eighth Algorithmic Number Theory Symposium (2008)

Mathematics

Number Theory

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Computing Hilbert Class Polynomials does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Computing Hilbert Class Polynomials, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computing Hilbert Class Polynomials will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-364790