Sciweavers

32 search results - page 2 / 7
» Software implementation of Tate pairing over GF(2m)
Sort
View
CHES
2005
Springer
111views Cryptology» more  CHES 2005»
13 years 11 months ago
Hardware Acceleration of the Tate Pairing in Characteristic Three
Although identity based cryptography offers many functional advantages over conventional public key alternatives, the computational costs are significantly greater. The core comp...
Philipp Grabher, Dan Page
SACRYPT
2001
Springer
106views Cryptology» more  SACRYPT 2001»
13 years 10 months ago
Fast Normal Basis Multiplication Using General Purpose Processors
—For cryptographic applications, normal bases have received considerable attention, especially for hardware implementation. In this article, we consider fast software algorithms ...
Arash Reyhani-Masoleh, M. Anwarul Hasan
SACRYPT
1999
Springer
13 years 10 months ago
Elliptic Curve Pseudorandom Sequence Generators
In this paper, we introduce a new approach to the generation of binary sequences by applying trace functions to elliptic curves over GF 2m. We call these sequences elliptic curve...
Guang Gong, Thomas A. Berson, Douglas R. Stinson
CIS
2006
Springer
13 years 10 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
ICISC
2004
120views Cryptology» more  ICISC 2004»
13 years 7 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