8 search results - page 1 / 2 » On Prime-Order Elliptic Curves with Embedding Degrees k = 3,... |
ANTS
2008
Springer
14 years 28 days ago
2008
Springer
Abstract. We further analyze the solutions to the Diophantine equations from which prime-order elliptic curves of embedding degrees k = 3, 4 or 6 (MNT curves) may be obtained. We g...
SACRYPT
2005
Springer
14 years 4 months ago
2005
Springer
Previously known techniques to construct pairing-friendly curves of prime or near-prime order are restricted to embedding degree k 6. More general methods produce curves over Fp wh...
ANTS
2006
Springer
14 years 2 months ago
2006
Springer
We present a general framework for constructing families of elliptic curves of prime order with prescribed embedding degree. We demonstrate this method by constructing curves with ...
DCC
2006
IEEE
14 years 10 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...
PAIRING
2009
Springer
14 years 5 months ago
2009
Springer
When using pairing-friendly ordinary elliptic curves over prime fields to implement identity-based protocols, there is often a need to hash identities to points on one or both of ...