Sciweavers

12 search results - page 1 / 3
» Choosing the correct elliptic curve in the CM method
Sort
View
MOC
2010
12 years 11 months ago
Choosing the correct elliptic curve in the CM method
We give an elementary way to distinguish between the twists of an ordinary elliptic curve E over Fp in order to identify the one with p+1-2U points, when p = U2 + dV 2 with 2U, 2V ...
Karl Rubin, Alice Silverberg
CHES
2001
Springer
130views Cryptology» more  CHES 2001»
13 years 9 months ago
Generating Elliptic Curves of Prime Order
A variation of the Complex Multiplication (CM) method for generating elliptic curves of known order over finite fields is proposed. We give heuristics and timing statistics in th...
Erkay Savas, Thomas A. Schmidt, Çetin Kaya ...
JOC
2010
96views more  JOC 2010»
12 years 11 months ago
On the Efficient Generation of Prime-Order Elliptic Curves
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 ...
Elisavet Konstantinou, Aristides Kontogeorgis, Yan...
INDOCRYPT
2003
Springer
13 years 10 months ago
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 po...
Elisavet Konstantinou, Yannis C. Stamatiou, Christ...
CMA
2010
183views more  CMA 2010»
13 years 1 months ago
Ramanujan's class invariants and their use in elliptic curve cryptography
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...
Elisavet Konstantinou, Aristides Kontogeorgis