Sciweavers

204 search results - page 1 / 41
» Powered Tate Pairing Computation
Sort
View
IEICET
2008
61views more  IEICET 2008»
13 years 4 months ago
Powered Tate Pairing Computation
In this paper, we introduce a powered Tate pairing on a supersingular elliptic curve that has the same shortened loop as the modified Tate pairing using the eta pairing approach by...
Bo Gyeong Kang, Je Hong Park
IPL
2006
86views more  IPL 2006»
13 years 4 months ago
On the relationship between squared pairings and plain pairings
In this paper, we investigate the relationship between the squared Weil/Tate pairing and the plain Weil/Tate pairing. Along these lines, we first show that the squared pairing for ...
Bo Gyeong Kang, Je Hong Park
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...
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
CHINAF
2008
69views more  CHINAF 2008»
13 years 4 months ago
Efficient Tate pairing computation using double-base chains
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...
Changan Zhao, Fangguo Zhang, Jiwu Huang