9 search results - page 1 / 2 » Efficient Tate pairing computation using double-base chains |
CHINAF
2008
13 years 4 months ago
2008
Pairing-based cryptosystems have been developing very fast in the last few years. The efficiencies of the cryptosystems are determined by the computation of the Tate pairing. In th...
ICISC
2004
13 years 6 months ago
2004
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...
CIS
2006
Springer
13 years 8 months ago
2006
Springer
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...
ICONS
2008
IEEE
13 years 11 months ago
2008
IEEE
DL systems with bilinear structure recently became an important base for cryptographic protocols such as identity-based encryption (IBE). Since the main computational task is the ...
IJNSEC
2008
13 years 4 months ago
2008
Identity-based cryptography uses pairing functions,which are sophisticated bilinear maps defined on elliptic curves.Computing pairings efficiently in software is presently a relev...