Edwards曲线上抗SPA快速标量乘算法

doi:10.3778/j.issn.1002-8331.1504-0013

计算机工程与应用 ›› 2017, Vol. 53 ›› Issue (1): 103-106.DOI: 10.3778/j.issn.1002-8331.1504-0013

Edwards曲线上抗SPA快速标量乘算法

刘双根1，姚华童1，李发根2

1.西安邮电大学通信与信息工程学院，西安 710121
2.电子科技大学计算机科学与工程学院，成都 611731

出版日期:2017-01-01 发布日期:2017-01-10

SPA resistant scalar multiplication on Edwards curve

LIU Shuanggen1, YAO Huatong1, LI Fagen2

1.School of Telecommunication and Information Engineering, Xi’an University of Posts and Telecommunications, Xi’an 710121, China
2.School of Computer Science and Engineering, University of Electronic Science and Technology, Chengdu 611731, China

Online:2017-01-01 Published:2017-01-10

摘要/Abstract

摘要： 针对Edwards曲线上标量乘法的效率及安全性，提出了马尔科夫点加-倍点链（Markov Addition-Double Chain，MADC）。基于MADC的椭圆曲线标量乘算法每次循环都固定执行“点加-倍点”运算，从而能够天然抵抗简单能量攻击。此外，倍点运算占总运算量的一半，由于Edwards曲线的倍点公式相对点加公式所需的运算量极少，新算法的运算量将大大减少。实验结果表明，MADC的最佳链长为160，MADC-160相对于EAC-320、SAC-260和 GRAC-258，效率分别提高了27%、10.4%和9.7%。

关键词: Edwards曲线, 标量乘法, 马尔科夫点加-倍点链（MADC）, 简单能量攻击

Abstract: In view of the efficiency and safety of Edwards curve scalar multiplication, this paper proposes Markov Addition-Double Chain（MADC）. The each loop of scalar multiplication algorithm based on MADC executes fixed “point addition-double” operation, which can resist the simple power analysis naturally. In addition, the timing cost of new algorithm will be reduced greatly because that the calculation of double operation accounts for half of the total and the computation of double operation needs very little calculation compared with point addition for Edwards curve. The experimental results show that, the length of MADC is 160 in the best case and the efficiency is increased by 27%, 10.4%and 9.7% respectively relative to EAC-320, SAC-260 and GRAC-258.

Key words: Edwards curve, scalar multiplication, Markov Addition-Double Chain（MADC）;simple power analysis

刘双根1，姚华童1，李发根2. Edwards曲线上抗SPA快速标量乘算法[J]. 计算机工程与应用, 2017, 53(1): 103-106.

LIU Shuanggen1, YAO Huatong1, LI Fagen2. SPA resistant scalar multiplication on Edwards curve[J]. Computer Engineering and Applications, 2017, 53(1): 103-106.

[1]	刘双根，赵辉. 基于Pell型序列的快速安全标量乘算法[J]. 计算机工程与应用, 2019, 55(4): 125-129.
[2]	赖忠喜，张安洁，张占军. 椭圆曲线中一种计算7P和7kP的改进算法[J]. 计算机工程与应用, 2016, 52(1): 29-32.
[3]	赖忠喜，林君焕，张占军. 素数域[GF(P)]上椭圆曲线快速标量乘算法的研究[J]. 计算机工程与应用, 2015, 51(4): 100-104.
[4]	赖忠喜，张占军. 椭圆曲线底层域快速算法的优化[J]. 计算机工程与应用, 2015, 51(22): 115-118.
[5]	赖忠喜，张占军，陶东娅. 椭圆曲线底层域快速算法的研究[J]. 计算机工程与应用, 2014, 50(3): 67-70.
[6]	徐凯平1，郑洪源1，刘锦峰2，顾晶晶1. 椭圆曲线密码体制中快速标量乘方法研究[J]. 计算机工程与应用, 2011, 47(15): 112-115.
[7]	童莲，钱江. 椭圆曲线中抗SPA和DPA攻击标量乘算法研究[J]. 计算机工程与应用, 2010, 46(35): 72-74.
[8]	殷新春,侯红祥. 一种定点快速标量乘算法的优化[J]. 计算机工程与应用, 2008, 44(4): 80-82.
[9]	刘连浩¹,申勇^1,2. Koblitz椭圆曲线标量乘法的二次研究[J]. 计算机工程与应用, 2008, 44(4): 141-144.
[10]	刘文波,张帆,郭云飞,刘力雄. F₂^m域椭圆曲线密码系统软件实现的优化技术研究[J]. 计算机工程与应用, 2008, 44(19): 28-30.

Edwards曲线上抗SPA快速标量乘算法

SPA resistant scalar multiplication on Edwards curve

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 10

编辑推荐

Metrics