[1]周克元,王丽.双参数无模逆椭圆曲线数字签名方案的分析与改进[J].计算机技术与发展,2025,(03):99-102.[doi:10.20165/j.cnki.ISSN1673-629X.2024.0337]
　ZHOU Ke-yuan,WANG Li.Analysis and Improvement on ECDSA of Two-parameter without Modular Inverse Operation[J].,2025,(03):99-102.[doi:10.20165/j.cnki.ISSN1673-629X.2024.0337]
点击复制

双参数无模逆椭圆曲线数字签名方案的分析与改进()

《计算机技术与发展》[ISSN:1006-6977/CN:61-1281/TN]

卷:
期数:
2025年03期
页码:
99-102
栏目:
网络空间安全
出版日期:
2025-03-10

文章信息/Info

Title:
Analysis and Improvement on ECDSA of Two-parameter without Modular Inverse Operation
文章编号:
1673-629X(2025)03-0099-04
作者:
周克元; 王丽
宿迁学院 文理学院,江苏 宿迁 223800
Author(s):
ZHOU Ke-yuan; WANG Li
School of LiberalArts and Science,Suqian University,Suqian 223800,China
关键词:
椭圆曲线; 数字签名; 模逆; 双参数; 改进
Keywords:
elliptic curve; digital signature; modular inverse; two-parameter; improved
分类号:
TP309.7
DOI:
10.20165/j.cnki.ISSN1673-629X.2024.0337
摘要:
对于椭圆曲线数字签名算法的改进问题主要有两个方向,一是增加各种特殊功能,例如前向安全、消息恢复等;二是降低运算复杂度。 椭圆曲线数字签名算法的运算包含点积、模乘、模逆和 Hash 函数运算,点积运算和 Hash 函数运算相对模乘和模逆运算复杂度较低,同时模逆运算时间是模乘运算时间的 10 倍,故算法的复杂度主要考虑模逆运算的次数,经典的椭圆曲线数字签名方案(ECDSA)中模逆运算为 2 次。 各类对复杂度的改进方案主要为对模逆运算进行改进,陈亚茹、肖帅和巫光福对 ECDSA 进行了改进,给出了三种双参数运算的改进方案,分别宣称模逆运算达到 1 次、0 次和 0 次。该文指出了三种方案中双参数方法的错误,双参数计算公式中的模逆运算无法做到方案中宣称的次数。 以肖帅方案为例,给出了新的双参数改进方案,模逆运算达到最小值 0 次。 最后将改进方案与已有方案进行了复杂度比较,复杂度更低,较好地解决了椭圆曲线数字签名双参数方案的改进问题。
Abstract:
There are mainly two directions for improving the elliptic curve digital signature algorithm, one is to add various special functions,such as forward security,message recovery; the other is to reduce the computational complexity. The computational complexity of the elliptic curve digital signature algorithm includes point multiplication,modular multiplication,modular inverse,and hash function operations. The complexity of point multiplication and hash function operations is lower than that of modular multiplication and modular inverse operations. At the same time,the inverse modular operation takes 10 times longer than the modular multiplication operation,so the complexity of the algorithm mainly considers the number of modular inverse operations. The classic elliptic curve digital signature scheme has two modular inverse operations. The various complexity improvement schemes mainly involve improving the modular inverse operation. Chen Yaru,Xiao Shuai,and Wu Guangfu improved ECDSA and gave three dual-parameter optimization schemes,respectively claiming one,zero,and zero modular inverse operations. The errors in the dual-parameter methods of the three schemes is pointed out,and the dual- parameter calculation formula cannot achieve the claimed modular inverse operation times. For example,a new dual - parameter optimization scheme was given for Xiao Shuai, with the minimum modular inverse operation of zero times. Finally, the complexity of the improved scheme was compared with that of the existing schemes,and the improved scheme had lower complexity,which solved the problem of improving the dual-parameter scheme of elliptic curve digital signature effectively.

相似文献/References:

[1]刘华春.基于PKI的网上证券交易系统的构建[J].计算机技术与发展,2009,(07):173.
　LIU Hua-chun.Implementing a System of On - line Securities Trading Based on PKI Technology[J].,2009,(03):173.
[2]王平水 赵俊杰.多用户环境中签名方案的安全性研究[J].计算机技术与发展,2009,(01):157.
　WANG Ping-shui,ZHAO Jun-jie.Research on Security of Multi - User Setting Signature Schemes[J].,2009,(03):157.
[3]王龙葛 王天芹 田珂 徐飞.基于椭圆曲线的盲数字签名及其身份识别[J].计算机技术与发展,2008,(06):142.
　WANG Long-ge,WANG Tian-qin,TIAN Ke,et al.A Blind Digital Signature Scheme and User Authentication Based on Elliptic Curves Cryptosystem[J].,2008,(03):142.
[4]邓晓军.PKI技术及其应用的分析[J].计算机技术与发展,2008,(06):144.
　DENG Xiao-jun.Analysis of PKI Technology and Its Application[J].,2008,(03):144.
[5]刘辉 李子臣.基于圆锥曲线的数字签名和Schnorr盲签名[J].计算机技术与发展,2008,(07):133.
　LIU Hui,LI Zi-chen.Digital Signature and Schnorr Blind Signature Based on Conic Curves[J].,2008,(03):133.
[6]赵青 唐英敏.数字签名在OpenType字库中的分析研究[J].计算机技术与发展,2008,(08):20.
　ZHAO Qing,TANG Ying-min.Analysis and Research of Digital Signature in OpenType Font[J].,2008,(03):20.
[7]黄滨 周德俭 卫传征.基于SAML的新型单点登陆模型研究[J].计算机技术与发展,2008,(09):219.
　HUANG Bin,ZHOU De-jian,WEI Chuan-zheng.Research of New Single Sign- on Model Based on SAML[J].,2008,(03):219.
[8]王平水.零知识数字签名方案中Hash值长度的研究[J].计算机技术与发展,2007,(06):170.
　WANG Ping-shui.Study on Length of Hash - Values for Digital Signature Schemes Based on Zero- Knowledge[J].,2007,(03):170.
[9]石润华 仲红.基于椭圆曲线离散对数的组签名方案[J].计算机技术与发展,2007,(11):153.
　SHI Run-hua,ZHONG Hong.Group Signature Schemes Based on Elliptic Curve Discrete Logarithm[J].,2007,(03):153.
[10]刘涛 潘道远.校园网络环境下数字签名的研究与设计[J].计算机技术与发展,2007,(12):128.
　LIU Tao,PAN Dao-yuan.Research and Design of Digital Signature Based on Campus Network Environment[J].,2007,(03):128.
[11]梁雨平 汤小华.一种前向安全性的可证实代理数字签名方案[J].计算机技术与发展,2007,(07):142.
　LIANG Yu-ping,TANG Xiao-hua.A Certifiable Representative Digital Signature Approach Based on Forward Security[J].,2007,(03):142.
[12]孙旭敏,刘彩霞.基于椭圆曲线的识别伪基站垃圾短信改进算法[J].计算机技术与发展,2018,28(07):121.[doi:10.3969/ j. issn.1673-629X.2018.07.026]
　SUN Xu-min,LIU Cai-xia.n Improved Algorithm of Identifying Spam Message of Pseudo Base Station Based on Elliptic Curve[J].,2018,28(03):121.[doi:10.3969/ j. issn.1673-629X.2018.07.026]

更新日期/Last Update: 2025-03-10