Sciweavers

IEICET
2008
147views more  IEICET 2008»
13 years 4 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...
ICISC
2007
100views Cryptology» more  ICISC 2007»
13 years 6 months ago
Pairing-Friendly Elliptic Curves with Small Security Loss by Cheon's Algorithm
Pairing based cryptography is a new public key cryptographic scheme. An elliptic curve suitable for pairing based cryptography is called a “pairing-friendly” elliptic curve. Af...
Aya Comuta, Mitsuru Kawazoe, Tetsuya Takahashi
PKC
2010
Springer
162views Cryptology» more  PKC 2010»
13 years 8 months ago
Faster Pairing Computations on Curves with High-Degree Twists
Research on efficient pairing implementation has focussed on reducing the loop length and on using high-degree twists. Existence of twists of degree larger than 2 is a very restric...
Craig Costello, Tanja Lange, Michael Naehrig
PAIRING
2007
Springer
108views Cryptology» more  PAIRING 2007»
13 years 10 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
PAIRING
2009
Springer
111views Cryptology» more  PAIRING 2009»
13 years 11 months ago
Faster Pairings on Special Weierstrass Curves
This paper presents efficient formulas for computing cryptographic pairings on the curve y2 = cx3 + 1 over fields of large characteristic. We provide examples of pairing-friendly...
Craig Costello, Hüseyin Hisil, Colin Boyd, Ju...