Sciweavers

4 search results - page 1 / 1
» Efficient Computation of Tate Pairing in Projective Coordina...
Sort
View
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
CIS
2006
Springer
13 years 8 months ago
Efficient Implementation of Tate Pairing on a Mobile Phone Using Java
Pairing-based cryptosystems (PBC) have been attracted by researchers in cryptography. Some implementations show that PBC are relatively slower than the standard public key cryptosy...
Yuto Kawahara, Tsuyoshi Takagi, Eiji Okamoto
CANS
2006
Springer
129views Cryptology» more  CANS 2006»
13 years 8 months ago
Side Channel Attacks and Countermeasures on Pairing Based Cryptosystems over Binary Fields
Pairings on elliptic curves have been used as cryptographic primitives for the development of new applications such as identity based schemes. For the practical applications, it is...
Tae-Hyun Kim, Tsuyoshi Takagi, Dong-Guk Han, Ho Wo...
AAECC
2003
Springer
165views Algorithms» more  AAECC 2003»
13 years 8 months ago
Fast Point Multiplication on Elliptic Curves through Isogenies
Elliptic curve cryptosystems are usually implemented over fields of characteristic two or over (large) prime fields. For large prime fields, projective coordinates are more suitabl...
Eric Brier, Marc Joye