New digital signature scheme based on discrete logarithm
New digital signature scheme based on discrete logarithm
复制标题
基于离散对数的新型数字签名方案
DOI：
10.1049/el:19940336
复制
发表时间：
1994
期刊：
影响因子：
--
通讯作者：
K. Nyberg
中科院分区：
文献类型：
--
作者：
K. Nyberg
本评论的目的是表明，Yen 和 Laih 提出的基于离散对数问题的数字签名方案（同上，第 29 卷，第 12 期，第 1120-1 页，1993）与其他基于基本形式的离散求幂的类似签名方案一样，容易受到替代攻击。这意味着给定已知消息的有效签名，在不知道私钥的情况下生成另一个不同的已知消息的有效签名在计算上是可行的。通常通过使用散列函数或冗余生成函数来防止替换。 >
The purpose of this Comment is to show that the digital signature scheme based on the discrete logarithm problem proposed by Yen and Laih (ibid., vol. 29, no. 12, p. 1120-1, 1993) is vulnerable to substitution attack like other similar signature schemes based on discrete exponentiation in their basic form. It means that given a valid signature of a known message, it is computationally feasible to generate a valid signature of another different known message without the knowledge of the private key. Substitution is typically prevented by the use of a hash function or a redundancy generating function. >