Sciweavers

Share
INDOCRYPT
2001
Springer

Elliptic Curves of Prime Order over Optimal Extension Fields for Use in Cryptography

11 years 10 months ago
Elliptic Curves of Prime Order over Optimal Extension Fields for Use in Cryptography
We present an algorithm for generating elliptic curves of prime order over Optimal Extension Fields suitable for use in cryptography. The algorithm is based on the theory of Complex Multiplication. Furthermore, we demonstrate the efficiency of the algorithm in practice by giving practical running times. In addition, we present statistics on the number of cryptographically strong elliptic curves of prime order for Optimal Extension Fields of cardinality (232 + c)5 with c < 0. We conclude that there are sufficiently many curves in this case.
Harald Baier
Added 30 Jul 2010
Updated 30 Jul 2010
Type Conference
Year 2001
Where INDOCRYPT
Authors Harald Baier
Comments (0)
books