19 search results - page 2 / 4 » On the Efficient Generation of Prime-Order Elliptic Curves |
DCC
2006
IEEE
14 years 5 months ago
2006
IEEE
In their seminal paper, Miyaji, Nakabayashi and Takano [12] describe a simple method for the creation of elliptic curves of prime order with embedding degree 3, 4, or 6. Such curve...
CMA
2010
13 years 2 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...
IEICET
2008
13 years 5 months ago
2008
The hyperelliptic curve cryptosystems take most of the time for computing a scalar multiplication kD of an element D in the Jacobian JC of a hyperelliptic curve C for an integer k....
EUROCRYPT
1999
Springer
13 years 9 months ago
1999
Springer
In this paper we discuss various aspects of cryptosystems based on hyperelliptic curves. In particular we cover the implementation of the group law on such curves and how to genera...
ACNS
2009
Springer
14 years 3 days ago
2009
Springer
We present an innovative technique to add elliptic curve points with the form P Q± , and discuss its application to the generation of precomputed tables for the scalar multiplicat...