Type of publication: | Inproceedings |
Entered by: | |
Title | On the Construction of Prime Order Elliptic Curves |
Bibtex cite ID | RACTI-RU1-2003-28 |
Booktitle | 4th International Conference on Cryptology |
Series | Lecture Notes in Computer Science |
Year published | 2003 |
Month | December |
Volume | 2904 |
Pages | 309-322 |
Organization | INDOCRYPT 2003 |
Location | New Delhi, India |
Abstract | 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. |
Authors | |
Topics
| |
BibTeX | BibTeX |
RIS | RIS |
Attachments |
C33-indocrypt2003-prime-order-ec.pdf (main file) |
|
Publication ID | 402 |