484 search results - page 1 / 97 » Computing Hilbert Class Polynomials |
ANTS
2008
Springer
14 years 1 months ago
2008
Springer
We present and analyze two algorithms for computing the Hilbert class polynomial HD. The first is a p-adic lifting algorithm for inert primes p in the order of discriminant D < ...
CMA
2010
13 years 8 months ago
2010
Complex Multiplication (CM) method is a frequently used method for the generation of elliptic curves (ECs) over a prime field Fp. The most demanding and complex step of this metho...
MOC
2011
13 years 6 months ago
2011
ISSAC
1989
Springer
14 years 3 months ago
1989
Springer
: We present a modification of the Goldwasser-Kilian-Atkin primality test, which, when given an input n, outputs either prime or composite, along with a certificate of correctnes...
ICISC
2004
14 years 16 days ago
2004
We consider the generation of prime order elliptic curves (ECs) over a prime field Fp using the Complex Multiplication (CM) method. A crucial step of this method is to compute the ...