首页 | 本学科首页   官方微博 | 高级检索  
     

椭圆曲线密码中一种多标量乘算法
引用本文:陈厚友,马传贵.椭圆曲线密码中一种多标量乘算法[J].软件学报,2011,22(4):782-788.
作者姓名:陈厚友  马传贵
作者单位:信息工程大学,信息工程学院,河南,郑州,450002
基金项目:国家自然科学基金(90704003); 国家高技术研究发展计划(863)(863-317-01-04-99, 2007AA01Z431); 河南省重大科技攻关项目(092101210502)
摘    要:标量乘和多标量乘是实现椭圆曲线密码体制的核心运算,其运算速度从整体上决定了椭圆曲线密码体制的实现效率.提出了一种多标量乘算法,该算法的基本思想是,将标量用带符号的整数阶乘展开式表示,并结合固定基窗口标量乘算法,使得实现多标量乘算法只需做点加运算即可.这不仅突破了传统求多标量乘算法的模式,而且提高了多标量乘的计算速度.同...

关 键 词:点乘  多标量乘  阶乘展开式  T-形多标量乘  固定基窗口算法
收稿时间:2008/11/20 0:00:00
修稿时间:2009/8/28 0:00:00

A Multiple Scalar Multiplications Algorithm in the Elliptic Curve Cryptosystem
CHEN Hou-You and MA Chuan-Gui.A Multiple Scalar Multiplications Algorithm in the Elliptic Curve Cryptosystem[J].Journal of Software,2011,22(4):782-788.
Authors:CHEN Hou-You and MA Chuan-Gui
Affiliation:Institute of Information Engineering, Information Engineering University, Zhengzhou 450002, China;Institute of Information Engineering, Information Engineering University, Zhengzhou 450002, China
Abstract:The main operations of elliptic curve cryptosystems (ECCs) are scalar multiplications and multi-scalar multiplications, which heavily determined the overall implementation of the efficiency of ECC. This algorithm extends the fixed-base window method by using the signed integer factorial expansions of scalar. The main characteristic of this method is that only a point addition computation is required, and it greatly improves the computational performance of a multi-scalar. Furthermore, the correctness proof and complexity analysis of the new algorithm are presented. At last, experimental results show that the computational efficiency increases about 47.8% to 56.5% when compared with other existing methods in the case m=2.
Keywords:point multiplication  multi-scalar multiplication  factorial expansion  T-multi-scalar multiplication  fixed-base window method
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《软件学报》浏览原始摘要信息
点击此处可从《软件学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号