【作者】 魏仕民； 陈国龙；

【Author】 Wei Shi-min,Chen Guo-long1 (Department of Mathematics,Huaibei Coal Normal College,Huaibei 235000)

【机构】 淮北煤炭师范学院计算机科学与技术系；

【摘要】 He和Kiesler在1994年提出一个基于求解离散对数问题和求解因子分解问题两个难题的数字签名方案。Harn在1995证明只要能够解因子分解问题就可以攻破He-Kiesler方案。同时,Lee和Hwang证明只要能够解离散对数问题就可以攻破He-Kiesler方案。本文给出He-Kiesler签名方案的两个改进方案,并对这两个方案的安全性进行讨论,结果表明,新方案的安全性依赖于两个困难问题——求解离散对数问题和求解因子分解问题。更多还原

【Abstract】 In 1994,He and Kiesler proposed a digital signature scheme based on factoring and discrete logarithms.1995,Harn showed that one can break the He-Kiesler scheme if one has the ability to solve the factorization,meanwhile,Lee and Hwang showed that if one has the ability to solve the discrete logarithms,one can break the He-Kiesler scheme.This paper proposes two modified He-Kiesler digital signature schemes.The security of new schemes is based on both factorization and discrete logarithms.更多还原