35 search results - page 3 / 7 » On the Construction of Prime Order Elliptic Curves |
CHES
2001
Springer
13 years 12 months ago
2001
Springer
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...
CRYPTO
1991
Springer
13 years 11 months ago
1991
Springer
Our purpose is to describe elliptic curves with complex multiplication which in characteristic 2 have the following useful properties for constructing Diffie-HeUman type cryptosys...
ASIACRYPT
2000
Springer
13 years 11 months ago
2000
Springer
The paper shows that some of elliptic curves over finite fields of characteristic three of composite degree are attacked by a more effective algorithm than Pollard’s ρ method...
CMA
2010
13 years 4 months ago
2010
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...
CORR
2004
Springer
13 years 7 months ago
2004
Springer
Cryptographic applications using an elliptic curve over a finite field filter curves for suitability using their order as the primary criterion: e.g. checking that their order has...