论文部分内容阅读
本文设计了两个数字签名协议,它们的安全性基于因数分解和离散对数的困难性,它们的性能类似于基本的ElGamal数字签名协议和Harn数字签名协议。本文还讨论了几种可能的攻击,证明了它们的安全性高于后两种数字签名协议。
In this paper, two digital signature protocols are designed. Their security is based on the difficulty of factorization and discrete logarithm. Their performance is similar to the basic ElGamal digital signature protocol and Harn digital signature protocol. This article also discusses several possible attacks that prove they are more secure than the latter two digital signature protocols.