Efficient Tate pairing computation using double-base chains |
| |
| Authors: | ChangAn Zhao FangGuo Zhang JiWu Huang |
| |
| Affiliation: | (1) School of Information Science and Technology, Sun Yat-Sen University, Guangdong Key Laboratory of Information Security Technology, Guangzhou, 510275, China |
| |
| Abstract: | 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. |
| |
| Keywords: | public key cryptography Tate pairing elliptic curves double-base chains |
| 本文献已被 维普 SpringerLink 等数据库收录！ |
