Sciweavers

ICISC
2004
120views Cryptology» more  ICISC 2004»
13 years 6 months ago
Efficient Computation of Tate Pairing in Projective Coordinate over General Characteristic Fields
Abstract. We consider the use of Jacobian coordinates for Tate pairing over general characteristics. The idea of encapsulated double-andline computation and add-and-line computatio...
Sanjit Chatterjee, Palash Sarkar, Rana Barua
CISC
2005
Springer
107views Cryptology» more  CISC 2005»
13 years 6 months ago
A Remark on Implementing the Weil Pairing
We propose an improved implementation of modified Weil pairings. By reduction of operations in the extension field to those in the base field, we can save some operations in the...
Cheol-Min Park, Myung-Hwan Kim, Moti Yung
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
IMA
2005
Springer
162views Cryptology» more  IMA 2005»
13 years 10 months ago
Pairing-Based Cryptography at High Security Levels
In recent years cryptographic protocols based on the Weil and Tate pairings on elliptic curves have attracted much attention. A notable success in this area was the elegant solutio...
Neal Koblitz, Alfred Menezes
DATE
2006
IEEE
127views Hardware» more  DATE 2006»
13 years 11 months ago
Software implementation of Tate pairing over GF(2m)
Recently, the interest about the Tate pairing over binary fields has decreased due to the existence of efficient attacks to the discrete logarithm problem in the subgroups of su...
Guido Bertoni, Luca Breveglieri, Pasqualina Fragne...
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
IMA
2007
Springer
94views Cryptology» more  IMA 2007»
13 years 11 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...
CANS
2009
Springer
109views Cryptology» more  CANS 2009»
13 years 11 months ago
Multi-core Implementation of the Tate Pairing over Supersingular Elliptic Curves
This paper describes the design of a fast multi-core library for the cryptographic Tate pairing over supersingular elliptic curves. For the computation of the reduced modified Tat...
Jean-Luc Beuchat, Emmanuel López-Trejo, Lui...