对两个双难题数字签名方案的攻击分析

Attack analysis on two digital signature schemes based on discrete logarithms and factoring

对基于离散对数和因子分解双难题的数字签名方案Z-C方案和I-T方案进行了攻击分析.若因子分解难题可计算或离散对数难题可计算,则Z-C方案可被替换消息伪造签名攻击;若离散对数难题可计算,则I-T方案可被伪造签名攻击.

The security of Z-C digital signature schemes and I-T digital signature schemes based on discrete logarithms and factoring were analyzed. If the difficulties of discrete logarithms or factoring can be solved, Z-C digital signature schemes can be attacked by forged signature. If the difficulties of discrete logarithms can he solved, I-T digital signature schemes can be attacked by forged signature.