Sciweavers

204 search results - page 2 / 41
» Powered Tate Pairing Computation
Sort
View
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
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....
PAIRING
2007
Springer
140views Cryptology» more  PAIRING 2007»
13 years 11 months ago
The Tate Pairing Via Elliptic Nets
We derive a new algorithm for computing the Tate pairing on an elliptic curve over a finite field. The algorithm uses a generalisation of elliptic divisibility sequences known as...
Katherine E. Stange
ANTS
2010
Springer
216views Algorithms» more  ANTS 2010»
13 years 8 months ago
Efficient Pairing Computation with Theta Functions
In this paper, we present a new approach based on theta functions to compute Weil and Tate pairings. A benefit of our method, which does not rely on the classical Miller's alg...
David Lubicz, Damien Robert