Sciweavers

10 search results - page 2 / 2
» On Near Prime-Order Elliptic Curves with Small Embedding Deg...
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
FFA
2007
85views more  FFA 2007»
13 years 5 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...
PAIRING
2009
Springer
124views Cryptology» more  PAIRING 2009»
13 years 12 months ago
Fast Hashing to G2 on Pairing-Friendly Curves
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 ...
Michael Scott, Naomi Benger, Manuel Charlemagne, L...
JOC
2010
106views more  JOC 2010»
13 years 3 months ago
A Taxonomy of Pairing-Friendly Elliptic Curves
Elliptic curves with small embedding degree and large prime-order subgroup are key ingredients for implementing pairingbased cryptographic systems. Such “pairing-friendly” curv...
David Freeman, Michael Scott, Edlyn Teske
PAIRING
2007
Springer
108views Cryptology» more  PAIRING 2007»
13 years 11 months ago
Constructing Pairing-Friendly Genus 2 Curves with Ordinary Jacobians
We provide the first explicit construction of genus 2 curves over finite fields whose Jacobians are ordinary, have large prime-order subgroups, and have small embedding degree. ...
David Freeman