Description:
A classical approach of constructing elliptic curves that can be used for cryptographic purposes relies on the theory of complex multiplication. A key ingredient in the algorithm is to compute the Hilbert class polynomial P_D for a suitable discriminate D. The polynomial P_D has integer coefficients, and is the minimal polynomial of the modular j-value j(O_D) for the imaginary quadratic order O_D of discriminate D. Reinier Broker of the University of Calgary presents a new p-adic algorithm to compute P_D and its advantages.
Speaker(s):
Reinier Broker, Ph.D., University of Calgary
|
