Cryptology ePrint Archive: Report 2006/201

Efficient Tate Pairing Computation Using Double-Base Chains

Chang'an Zhao and Fangguo Zhang and Jiwu Huang

Abstract: 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 double-base 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.

Category / Keywords: public-key cryptography /

Date: received 9 Jun 2006, last revised 21 Jun 2006

Contact author: isszhfg at mail sysu edu cn

Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

Version: 20060622:013936 (All versions of this report)

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]