Welcome to the resource topic for 2006/201
Title:
Efficient Tate Pairing Computation Using Double-Base Chains
Authors: Chang'an Zhao, Fangguo Zhang, 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.
ePrint: https://eprint.iacr.org/2006/201
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .