摘要
针对基于离散对数和因子分解双难题的数字签名方案Shao方案的攻击提出了一个新的改进方案,证明了其正确性、安全性和不可伪造性。并与两个已有方案进行了算法复杂度比较,证实了该方案的优越性。
A new improved scheme of Shao＇ s digital signature scheme is and discrete logarithm problems. The correctness, security and unforgeabili schemes, the improved scheme is more efficient in terms of the computation proposed, which is ty are proved. As c complexity. based on ompared factoring with two
出处
《科学技术与工程》
北大核心
2013年第26期7862-7864,7868,共4页
Science Technology and Engineering
基金
宿迁市科研项目(z201104)资助
关键词
数字签名
离散对数
因子分解
伪造签名Hash函数
算法复杂度
signature algorithm
discrete logarithms
factoring
forgery signature
Hash function
algorithm complexity
