改进的椭圆曲线数字签名方案及实例分析  

IMPROVED ELLIPTIC CURVE DIGITAL SIGNATURE SCHEME AND CASE ANALYSIS

作　　者：杨青 王昊轩 梁磊 黄林飞 Yang Qing;Wang Haoxuan;Liang Lei;Huang Linfei(Faculty of Science,Xi’an Aeronautical University,Xi’an 710077,Shaanxi,China)

机构地区：[1]西安航空学院理学院,陕西西安710077

出　　处：《计算机应用与软件》2023年第1期327-330,343,共5页Computer Applications and Software

基　　金：陕西省科技厅项目(2013JM1019);陕西省教育厅项目(17JK0394);西安航空学院基金项目(18ZLGC308,18JXGG2014);陕西省自然科学基金面上项目(2022JM-014)。

摘　　要：与传统的公钥算法进行比较,椭圆曲线密码学(ECC)在基于有限域上离散对数问题或者大整数分解问题等方面具有明显的优势。以椭圆曲线为基础,提出改进的数字签名方案,并对改进方案的安全性和复杂度进行分析。改进方案对生日攻击具有较高的防御性,提高了数字签名的安全性能,且运算量不大。通过MATLAB实例验证了该算法的正确性。Compared with the traditional public key algorithm, elliptic curve cryptography(ECC) has obvious advantages on the discrete logarithm problem or large integer factorization problem based on the finite field. Based on the elliptic curve, this paper proposes an improved digital signature scheme. The security and complexity of the improved scheme was analyzed. The improved scheme had a high defensive to the birthday attack. The scheme improved the security performance of the digital signature, and did not require much computation. The correctness of the algorithm was verified by an example of MATLAB.

关 键 词：椭圆曲线 数字签名 离散对数问题 生日攻击 

分 类 号：TP309[自动化与计算机技术—计算机系统结构]