9 search results - page 1 / 2 » Faster Pairing Computations on Curves with High-Degree Twist... |
PKC
2010
Springer
13 years 8 months ago
2010
Springer
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...
IMA
2007
Springer
13 years 10 months ago
2007
Springer
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 ...
PAIRING
2009
Springer
13 years 11 months ago
2009
Springer
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...
EUROCRYPT
2011
Springer
12 years 8 months ago
2011
Springer
Abstract. We describe efficient formulas for computing pairings on ordinary elliptic curves over prime fields. First, we generalize lazy reduction techniques, previously considere...
IACR
2011
12 years 4 months ago
2011
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...