Sciweavers

9 search results - page 2 / 2
» Constructing Pairing-Friendly Elliptic Curves with Embedding...
Sort
View
TIT
2010
108views Education» more  TIT 2010»
13 years 5 months ago
Optimal pairings
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...
Frederik Vercauteren
JOC
2006
80views more  JOC 2006»
13 years 10 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
FFA
2007
85views more  FFA 2007»
13 years 10 months ago
Ordinary abelian varieties having small embedding degree
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 ...
Steven D. Galbraith, James F. McKee, P. C. Valen&c...
MICS
2010
128views more  MICS 2010»
13 years 5 months ago
Arrangements on Parametric Surfaces II: Concretizations and Applications
We describe the algorithms and implementation details involved in the concretizations of a generic framework that enables exact construction, maintenance, and manipulation of arran...
Eric Berberich, Efi Fogel, Dan Halperin, Michael K...