双线性对有效计算研究进展-软件学报.PDF

ISSN 1000-9825, CODEN RUXUEW E-mail: jos@ Journal of Software , Vol.20, No.11, November 2009, pp.3001−3009 doi: 10.3724/SP.J.1001.2009.03651 Tel/Fax: +86-10 © by Institute of Software , the Chinese Academy of Sciences . All rights reserved. ∗ 双线性对有效计算研究进展 1,2 1,3+ 赵昌安 , 张方国 1( 中山大学 信息科学与技术学院,广东 广州 510275) 2 (广州大学 计算机科学与教育软件学院,广东 广州 510006) 3( 中山大学 广东省信息安全技术重点实验室,广东 广州 510275) Research and Development on Efficient Pairing Computations ZHAO Chang-An 1,2, ZHANG Fang-Guo1,3+ 1(School of Information Science and Technology, Sun Yat-Sen University, Guangzhou 510275, China) 2 (School of Computer Science and Educational Software, Guangzhou University, Guangzhou 510006, China) 3(Guangdong Key Laboratory of Information Security Technology, Sun Yat-Sen University, Guangzhou 510275, China) + Corresponding author: E-mail: isszhfg@ Zhao CA, Zhang FG. Research and development on efficient pairing computations. Journal of Software, 2009, 20(11):3001−3009. /1000-9825/3651.htm Abstract : Pairings have found many cryptographic applications in recent years. The efficiency of implementing these cryptographic applications is determined by the speed of pairing computations. This paper categorizes and reviews the current progress on efficient pairing computations, and suggests the possibility of further research. Key words: public key cryptography; pairing-based cryptosystem; elliptic curve; pairing computation; efficient algorithm 摘 要: 近年来,双线性对获得了广泛的密码应用.实现这些应用的效率,取决于双线性对的计算速度.分类回顾了 双线性对有效计算方面的已有进展,并提出了进一步工作的可能性. 关键词: 公钥密码学;基于双线性对的密