关键词: 数字签名, 离数对数问题, 大整数分解问题, 二次剩余, 公钥密码

Abstract:

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.

Key words: digital signature;discrete logarithm problem;factorization-problem;quadratic residue;public key cryptography