Sciweavers

18 search results - page 2 / 4
» Elliptic Curves with Low Embedding Degree
Sort
View
JOC
2010
106views more  JOC 2010»
13 years 6 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
2010
Springer
133views Cryptology» more  PAIRING 2010»
13 years 5 months ago
Pairing Computation on Elliptic Curves with Efficiently Computable Endomorphism and Small Embedding Degree
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...
Sorina Ionica, Antoine Joux
FFA
2007
85views more  FFA 2007»
13 years 7 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...
SACRYPT
2005
Springer
112views Cryptology» more  SACRYPT 2005»
14 years 29 days ago
Pairing-Friendly Elliptic Curves of Prime Order
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...
Paulo S. L. M. Barreto, Michael Naehrig
ISCAS
2008
IEEE
154views Hardware» more  ISCAS 2008»
14 years 1 months ago
A 6.3nJ/op low energy 160-bit modulo-multiplier for elliptic curve cryptography processor
— A low energy modulo-multiplier is proposed for elliptic curve cryptography (ECC) processor, especially for authentication in mobile device or key encryption in embedded health-...
Hyejung Kim, Yongsang Kim, Hoi-Jun Yoo