摘要
邵祖华提出了一个同时基于离散对数问题(DLP)和因子分解问题(FP)两个数学难题的数字签名方案[1](Shao S ignatureSchem e),但是该方案的安全性仅仅依赖于因子分解问题[2],任俊伟和林东岱对其进行了改进[3]。指出改进的数字签名方案的一个错误并对其安全性进行分析,证明当离散对数可解时改进方案是不安全的。
Shao Zuhua proposed a digital signature scheme based on both the discrete logarithm problem and the factoring problem （Shao Signature Scheme）, but the security of this scheme only relies on factoring problem. Ren Junwei and Lin Dongdai had improved this scheme. In this paper, we will point out a mistake of the improved scheme, analyse its security, and prove its insecurity in condition of the discrete logarithm being solvable.
出处
《计算机应用与软件》
CSCD
2009年第7期272-273,共2页
Computer Applications and Software
关键词
数字签名
离散对数
因子分解
Digital signature scheme
Discrete logarithm
Factoring
