Sciweavers

22 search results - page 2 / 5
» Ate Pairing on Hyperelliptic Curves
Sort
View
IEICET
2008
147views more  IEICET 2008»
13 years 7 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...
DCC
2007
IEEE
14 years 7 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 ...
PAIRING
2010
Springer
237views Cryptology» more  PAIRING 2010»
13 years 5 months ago
High-Speed Software Implementation of the Optimal Ate Pairing over Barreto-Naehrig Curves
This paper describes the design of a fast software library for the computation of the optimal ate pairing on a Barreto–Naehrig elliptic curve. Our library is able to compute the ...
Jean-Luc Beuchat, Jorge E. González-D&iacut...
ANTS
2004
Springer
112views Algorithms» more  ANTS 2004»
14 years 24 days 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
14 years 18 days 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