 |
Conference papers
Computing Hilbert Class Polynomials
Abstract : 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.
Cited literature [21 references]
https://hal.inria.fr/inria-00246115
Contributor : Andreas Enge <>
Submitted on : Thursday, February 7, 2008 - 2:50:25 PM
Last modification on : Thursday, March 5, 2020 - 6:21:30 PM
Long-term archiving on: : Monday, May 10, 2010 - 12:44:38 PM
Contributor : Andreas Enge <>
Submitted on : Thursday, February 7, 2008 - 2:50:25 PM
Last modification on : Thursday, March 5, 2020 - 6:21:30 PM
Long-term archiving on: : Monday, May 10, 2010 - 12:44:38 PM
Files
ants8.pdf
Files produced by the author(s)