一种抗侧信道攻击椭圆曲线标量乘算法的设计与实现

发布时间：2018-03-27 22:21

本文选题：椭圆曲线　切入点：标量乘算法　出处：《计算机应用研究》2017年02期

【摘要】：有限域GF(2m)上点乘运算是影响椭圆曲线密码实现效率的关键运算之一。为提高椭圆曲线密码算法计算的安全性和效率性,从分析固定基点梳形(fixed-base comb)算法的特点出发,在现有的边信道攻击和标量乘算法的基础上,提出了一种新的标量乘算法——DF-Comb(distance fixed-base comb)算法。新的算法对私钥(k)重新设计编码、分组计算,在预计算阶段和赋值阶段进行改进,能够极大地提高算法计算阶段的效率;此外,考虑到算法的抗侧信道攻击能力,通过引入乘数分解技术来隐藏算法中相关侧信道信息,引入一种同时多标量乘算法用来提高抗侧道攻击力,从而增强算法的安全性。仿真实验结果显示,改进的DF-comb算法可以在提高计算效率的同时降低计算的存储量。经算法实验比较分析研究,表明该算法能较好地抵抗多种侧信道攻击。
[Abstract]:Point multiplication is one of the key operations affecting the efficiency of elliptic curve cryptography. In order to improve the security and efficiency of elliptic curve cryptography, the characteristics of fixed-base point combed-base algorithm are analyzed. Based on the existing edge channel attacks and scalar multiplication algorithms, a new scalar multiplication algorithm, DF-Comb distance fixed-base combination, is proposed. Moreover, considering the ability of the algorithm to resist side channel attack, the multiplier decomposition technique is introduced to hide the related side channel information in the algorithm. A new multi-scalar multiplication algorithm is introduced to improve the anti-attack force of the side track, thus enhancing the security of the algorithm. The simulation results show that, The improved DF-comb algorithm can improve the computational efficiency and reduce the memory of the computation. The experimental results show that the algorithm can resist multiple side channel attacks.
【作者单位】：上海海事大学信息工程学院;
【基金】：国家自然科学基金资助项目(61202370) 上海市教委科研创新资助项目(14YZ110) 中国博士后科学基金资助项目(2014M561512)
【分类号】：TN918.1

【参考文献】