Sciweavers

4 search results - page 1 / 1
» Generating Prime Order Elliptic Curves: Difficulties and Eff...
Sort
View
ICISC
2004
108views Cryptology» more  ICISC 2004»
14 years 11 months ago
Generating Prime Order Elliptic Curves: Difficulties and Efficiency Considerations
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...
JOC
2010
96views more  JOC 2010»
14 years 4 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...
86
Voted
CMA
2010
183views more  CMA 2010»
14 years 6 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
CTRSA
2010
Springer
191views Cryptology» more  CTRSA 2010»
15 years 1 months ago
Making the Diffie-Hellman Protocol Identity-Based
This paper presents a new identity based key agreement protocol. In id-based cryptography (introduced by Adi Shamir in [33]) each party uses its own identity as public key and rece...
Dario Fiore, Rosario Gennaro