Sciweavers

12 search results - page 1 / 3
» Improved Weil and Tate Pairings for Elliptic and Hyperellipt...
Sort
View
ANTS
2004
Springer
112views Algorithms» more  ANTS 2004»
13 years 10 months ago
Improved Weil and Tate Pairings for Elliptic and Hyperelliptic Curves
We present algorithms for computing the squared Weil and Tate pairings on an elliptic curve and the squared Tate pairing for hyperelliptic curves. The squared pairings introduced i...
Kirsten Eisenträger, Kristin Lauter, Peter L....
ASIACRYPT
2003
Springer
13 years 10 months ago
Tate Pairing Implementation for Hyperelliptic Curves y2 = xp-x + d
The Weil and Tate pairings have been used recently to build new schemes in cryptography. It is known that the Weil pairing takes longer than twice the running time of the Tate pair...
Iwan M. Duursma, Hyang-Sook Lee
CTRSA
2003
Springer
130views Cryptology» more  CTRSA 2003»
13 years 10 months ago
Fast Elliptic Curve Arithmetic and Improved Weil Pairing Evaluation
We present an algorithm which speeds scalar multiplication on a general elliptic curve by an estimated 3.8% to 8.5% over the best known general methods when using affine coordinate...
Kirsten Eisenträger, Kristin Lauter, Peter L....
EUROCRYPT
2007
Springer
13 years 11 months ago
Ate Pairing on Hyperelliptic Curves
Abstract. In this paper we show that the Ate pairing, originally defined for elliptic curves, generalises to hyperelliptic curves and in fact to arbitrary algebraic curves. It has...
Robert Granger, Florian Hess, Roger Oyono, Nicolas...
DCC
2007
IEEE
14 years 4 months ago
Efficient pairing computation on supersingular Abelian varieties
Abstract. We present a general technique for the efficient computation of pairings on supersingular Abelian varieties. This formulation, which we call the eta pairing, generalises ...
Paulo S. L. M. Barreto, Steven D. Galbraith, Colm ...