Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

19

CHINAF
2008

favoriteEmaildiscussreport

69views more CHINAF 2008»

Efficient Tate pairing computation using double-base chains

13 years 4 months ago

Efficient Tate pairing computation using double-base chains

Download eprint.iacr.org

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 this paper a new efficient algorithm based on double-base chain for computing the Tate pairing is proposed for odd characteristic p > 3. The inherent sparseness of doublebase number system reduces the computational cost for computing the Tate pairing evidently. It is 9% faster than the previous fastest method for MOV degree k=6.

Changan Zhao, Fangguo Zhang, Jiwu Huang

Real-time Traffic

CHINAF 2008 | Pairing | Pairing-based Cryptosystems | Tate |

claim paper

Related Content

» Efficient Computation of Tate Pairing in Projective Coordinate over General Characteristic...

» Efficient Implementation of Tate Pairing on a Mobile Phone Using Java

» An Efficient Hardware Implementation of the Tate Pairing in Characteristic Three

» Parallel Hardware Architectures for the Cryptographic Tate Pairing

» Efficient pairing computation on supersingular Abelian varieties

» Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure

» A Markov Chain Monte Carlo Approach to Stereovision

» HCBGP A lightweight and flexible scheme for securing prefix ownership

Post Info
More Details (n/a)

Added	09 Dec 2010
Updated	09 Dec 2010
Type	Journal
Year	2008
Where	CHINAF
Authors	Changan Zhao, Fangguo Zhang, Jiwu Huang

Comments (0)