Sciweavers

18 search results - page 1 / 4
» Elliptic Curves with Low Embedding Degree
Sort
View
JOC
2006
80views more  JOC 2006»
13 years 5 months ago
Elliptic Curves with Low Embedding Degree
Motivated by the needs of the pairing based cryptography, Miyaji, Nakabayashi and Takano have suggested a construction of so-called MNT elliptic curves with low embedding degree. ...
Florian Luca, Igor Shparlinski
IEICET
2008
147views more  IEICET 2008»
13 years 5 months ago
Computing the Ate Pairing on Elliptic Curves with Embedding Degree k = 9
For AES 128 security level there are several natural choices for pairing-friendly elliptic curves. In particular, as we will explain, one might choose curves with k = 9 or curves w...
Xibin Lin, Changan Zhao, Fangguo Zhang, Yanming Wa...
ANTS
2008
Springer
103views Algorithms» more  ANTS 2008»
13 years 7 months ago
On Prime-Order Elliptic Curves with Embedding Degrees k = 3, 4, and 6
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...
Koray Karabina, Edlyn Teske
DCC
2006
IEEE
14 years 4 months ago
Generating More MNT Elliptic Curves
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...
Michael Scott, Paulo S. L. M. Barreto
ANTS
2006
Springer
95views Algorithms» more  ANTS 2006»
13 years 9 months ago
Constructing Pairing-Friendly Elliptic Curves with Embedding Degree 10
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 ...
David Freeman