摘要
对文献[5]提出的数字签名方案进行了总结和推广,以其中运算量最小的数字签名方案为基础设计了一种同时基于因数分解和离散对数的有序多重数字签名方案。该方案在验证过程中避免了求逆运算,使签名速度有了很大提高,具有广泛的应用价值,而且同时基于两个数学难题,其安全性较强。
The digital signature proposed by Ying Yuanbin and Cheng Yihong was summarized, and proposed a new sequential digital multi-signature scheme was proposed based on the discrete logarithms and factoring problems. The proposed scheme was modified from the signature of Ying Yuanbin and Chcng Yihong＇s, which is the minimum computational load in all of them. This signature scheme can avoid the computation for inversion in verification phase and improve the signing speed, and be used widely in many fields. In addition, the security of this signature based on the two mathematic problems can be increased compared to ones, such as Li＇s signature.
出处
《计算机工程与设计》
CSCD
北大核心
2006年第1期112-113,128,共3页
Computer Engineering and Design
关键词
离散对数
因数分解
多重数字签名
discrete logarithm
factoring
digital multi-signature
