摘要
对离散对数数字签名算法进行分析,给出复杂度最低的改进算法,证明其正确性和不可伪造性,且指数运算和模逆运算达到最小值2次和0次。与已有方案进行了复杂度比较,签名效率有较大提高。
The discrete logarithm digital signature algorithm is analyzed, and the improvement measure is given, the correctness and unforgeability are proved. The numbers of modular multiplication and modular inverse operations are decreased, and the improvement measure is of less time complexity than existing signature algorithms.
出处
《计算机与现代化》
2013年第11期82-84,共3页
Computer and Modernization
基金
宿迁市科研项目(z201104)
江苏省大学生实践创新项目(201314160003Y)
关键词
离散对数
数字签名
模乘
模逆
discrete logarithm
signature algorithm
modular multiplication
modular inverse
