9 search results - page 2 / 2 » Constructing Pairing-Friendly Elliptic Curves with Embedding... |
TIT
2010
12 years 12 months ago
2010
In this paper we introduce the concept of an optimal pairing, which by definition can be computed using only log2 r/(k) basic Miller iterations, with r the order of the groups invo...
JOC
2006
13 years 5 months ago
2006
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. ...
FFA
2007
13 years 5 months ago
2007
Miyaji, Nakabayashi and Takano (MNT) gave families of group orders of ordinary elliptic curves with embedding degree suitable for pairing applications. In this paper we generalise ...
MICS
2010
13 years 3 hour ago
2010
We describe the algorithms and implementation details involved in the concretizations of a generic framework that enables exact construction, maintenance, and manipulation of arran...