Efficient Tate Pairing Computation Using Double-Base Chains

Chang'an Zhao; Fangguo Zhang; Jiwu Huang

Paper 2006/201

Efficient Tate Pairing Computation Using Double-Base Chains

Chang'an Zhao, 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.

Metadata

Available format(s): PDF PS
Category: Public-key cryptography
Publication info: Published elsewhere. Unknown where it was published
Contact author(s): isszhfg @ mail sysu edu cn
History: 2006-06-22: last of 4 revisions; 2006-06-20: received; See all versions
Short URL: https://ia.cr/2006/201
License: CC BY

BibTeX

@misc{cryptoeprint:2006/201,
      author = {Chang'an Zhao and Fangguo Zhang and Jiwu Huang},
      title = {Efficient Tate Pairing Computation Using Double-Base Chains},
      howpublished = {Cryptology {ePrint} Archive, Paper 2006/201},
      year = {2006},
      url = {https://eprint.iacr.org/2006/201}
}