摘要
本文设计了两个数字签名协议,它们的安全性基于因数分解和离散对数的困难性,它们的性能类似于基本的ElGamal数字签名协议和Harn数字签名协议。本文还讨论了几种可能的攻击,证明了它们的安全性高于后两种数字签名协议。
This paper proposes two new digital signature schemes, the security of which is based on the difficulties of computing discrete logarithms and factoring, the performance of which is similar to those of the original ElGamal signature scheme and the Ham signature scheme. This paper also considers some possible attacks, shows that the new schemes are more secure than the latter two schemes.
出处
《信息安全与通信保密》
1998年第4期36-41,共6页
Information Security and Communications Privacy
关键词
密码学
数字签名协议
离散对数
因数分解
cryptography, digital signature scheme, discrete logarithm,factoring
