摘要
针对Edwards曲线上标量乘法的效率及安全性,提出了马尔科夫点加-倍点链(Markov Addition-Double Chain,MADC)。基于MADC的椭圆曲线标量乘算法每次循环都固定执行"点加-倍点"运算,从而能够天然抵抗简单能量攻击。此外,倍点运算占总运算量的一半,由于Edwards曲线的倍点公式相对点加公式所需的运算量极少,新算法的运算量将大大减少。实验结果表明,MADC的最佳链长为160,MADC-160相对于EAC-320、SAC-260和GRAC-258,效率分别提高了27%、10.4%和9.7%。
In view of the efficiency and safety of Edwards curve scalar multiplication, this paper proposes MarkovAddition-Double Chain(MADC). The each loop of scalar multiplication algorithm based on MADC executes fixed“point additiondouble”operation, which can resist the simple power analysis naturally. In addition, the timing cost of new algorithm willbe reduced greatly because that the calculation of double operation accounts for half of the total and the computation ofdouble operation needs very little calculation compared with point addition for Edwards curve. The experimental resultsshow that, the length of MADC is 160 in the best case and the efficiency is increased by 27%, 10.4%and 9.7% respectivelyrelative to EAC-320, SAC-260 and GRAC-258.
作者
刘双根
姚华童
李发根
LIU Shuanggen;YAO Huatong;LI Fagen(School of Telecommunication and Information Engineering, Xi’an University of Posts and Telecommunications, Xi’an 710121, China;School of Computer Science and Engineering, University of Electronic Science and Technology, Chengdu 611731, China)
出处
《计算机工程与应用》
CSCD
北大核心
2017年第1期103-106,共4页
Computer Engineering and Applications
基金
国家自然科学基金(No.61272525)
陕西省教育厅科研计划资助项目(No.2013JK1097)
