摘要
为在同等计算复杂度的前提下提高算法的安全性,提出一个新的数字签名方案。在不扩大有限域zq*的基础上,通过增加本原根的维数,并且引入HAsh函数和二次剩余,基于多个数学难题对经典的Neberg-Rueppel[1]签名体制进行改进。通过比较发现新算法的安全性大大增强,但是其复杂度却没有相应增加。
To promote the security of an algorithm under the same computational complexity,a new digital signature scheme is proposed.In this scheme,without expanding the finite field z＊q,by increasing the number of the dimensions of the original roots,we can improve the classical Neberg-Rueppel algorithm on the basis of the introduction of HASH function and quadratic residue.A comparison shows that the security of the new algorithm is greatly improved without a corresponding increase in complexity.
出处
《电子科技》
2011年第4期15-16,42,共3页
Electronic Science and Technology
关键词
数字签名
离数对数问题
大整数分解问题
二次剩余
公钥密码
digital signature
discrete logarithm problem
factorization-problem
quadratic residue
public key cryptography
