论文部分内容阅读
Pairing-based cryptosystems have developed very fast in the last few years.The effi-ciencies of these cryptosystems depend on the computation of the bilinear pairings.In this paper,a new efficient algorithm based on double-base chains 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.The new algorithm is 9% faster than the previous fastest method for the embedding degree k=6.
Pairing-based cryptosystems have developed very fast in the last few years. Effi-ciencies of these cryptosystems depend on the computation of the bilinear pairings. In this paper, a new efficient algorithm based on double-base chains 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.The new algorithm is 9% faster than the last fastest method for the embedding degree k = 6.