On the Construction of Prime Order Elliptic Curves

We consider a variant of the Complex Multiplication (CM) method for constructing elliptic curves (ECs) of prime order with additional security properties. Our variant uses Weber polynomials whose discriminant D is congruent to 3 (mod 8), and is based on a new transformation for converting roots of Weber polynomials to their Hilbert counterparts. We also present a new theoretical estimate of the bit precision required for the construction of the Weber polynomials for these values of D. We conduct a comparative experimental study investigating the time and bit precision of using Weber polynomials against the (typical) use of Hilbert polynomials. We further investigate the time efficiency of the new CM variant under four different implementations of a crucial step of the variant and demonstrate the superiority of two of them.

• Type: Conference
• Year: 2003
• Where: INDOCRYPT
• Authors: Elisavet Konstantinou, Yannis C. Stamatiou, Christos D. Zaroliagis
• Keywords: Bit Precision, INDOCRYPT 2003, Uses Weber Polynomials, Weber Polynomials