Efficient Tate pairing computation using double-base chains

作     者：ZHAO ChangAn ZHANG FangGuo HUANG JiWu 

作者机构：School of Information Science and Technology Sun Yat-Sen University Guangdong Key Laboratory of Information Security Technology Guangzhou 510275 China 

出 版 物：《Science in China(Series F)》 (中国科学（F辑英文版）)

年 卷 期：2008年第51卷第8期

页      面：1096-1105页

核心收录：

学科分类：11[军事学] 0810[工学-信息与通信工程] 1105[军事学-军队指挥学] 0808[工学-电气工程] 0839[工学-网络空间安全] 08[工学] 110505[军事学-密码学] 110503[军事学-军事通信学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：the National Natural Science Foundation of China(Grant Nos.60403007 and 60633030) the Major State Basic Research Development Program of China(973 Program)(Grant No.2006CB303104) 

主　　题：public key cryptography Tate pairing elliptic curves double-base chains 

摘      要：Pairing-based cryptosystems have developed very fast in the last few years. The efficiencies 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.