Sciweavers

9 search results - page 1 / 2
» Faster Pairing Computations on Curves with High-Degree Twist...
Sort
View
PKC
2010
Springer
162views Cryptology» more  PKC 2010»
14 years 2 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
IMA
2007
Springer
94views Cryptology» more  IMA 2007»
14 years 5 months ago
Optimised Versions of the Ate and Twisted Ate Pairings
The Ate pairing and the twisted Ate pairing for ordinary elliptic curves which are generalizations of the ηT pairing for supersingular curves have previously been proposed. It is ...
Seiichi Matsuda, Naoki Kanayama, Florian Hess, Eij...
PAIRING
2009
Springer
111views Cryptology» more  PAIRING 2009»
14 years 5 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...
EUROCRYPT
2011
Springer
13 years 2 months ago
Faster Explicit Formulas for Computing Pairings over Ordinary Curves
Abstract. We describe efficient formulas for computing pairings on ordinary elliptic curves over prime fields. First, we generalize lazy reduction techniques, previously considere...
Diego F. Aranha, Koray Karabina, Patrick Longa, Ca...
IACR
2011
133views more  IACR 2011»
12 years 10 months ago
Attractive Subfamilies of BLS Curves for Implementing High-Security Pairings
Barreto-Lynn-Scott (BLS) curves are a stand-out candidate for implementing high-security pairings. This paper shows that particular choices of the pairing-friendly search parameter...
Craig Costello, Kristin Lauter, Michael Naehrig