10 search results - page 1 / 2 » On Near Prime-Order Elliptic Curves with Small Embedding Deg... |
ANTS
2008
Springer
13 years 6 months 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
13 years 10 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...
DCC
2006
IEEE
14 years 4 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...
ANTS
2006
Springer
13 years 8 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 ...
PAIRING
2010
Springer
13 years 2 months ago
2010
Springer
Scott uses an efficiently computable isomorphism in order to optimize pairing computation on a particular class of curves with embedding degree 2. He points out that pairing implem...