CryptoDB

Paper: Efficient Tate Pairing Computation Using Double-Base Chains

Authors: Chang'an Zhao Fangguo Zhang Jiwu Huang URL: http://eprint.iacr.org/2006/201 Search ePrint Search Google 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.
BibTeX
@misc{eprint-2006-21694,
title={Efficient Tate Pairing Computation Using Double-Base Chains},
booktitle={IACR Eprint archive},
keywords={public-key cryptography /},
url={http://eprint.iacr.org/2006/201},
note={ isszhfg@mail.sysu.edu.cn 13321 received 9 Jun 2006, last revised 21 Jun 2006},
author={Chang'an Zhao and Fangguo Zhang and Jiwu Huang},
year=2006
}