首页    期刊浏览 2024年11月24日 星期日
登录注册

文章基本信息

  • 标题:Comments on Wei’s Digital Signature Scheme Based on Two Hard Problems
  • 本地全文:下载
  • 作者:H. F. Lin ; C. Y. Gun ; C. Y. Chen
  • 期刊名称:International Journal of Computer Science and Network Security
  • 印刷版ISSN:1738-7906
  • 出版年度:2009
  • 卷号:9
  • 期号:2
  • 页码:1-3
  • 出版社:International Journal of Computer Science and Network Security
  • 摘要:

    In 1998, Shao proposed two digital signature schemes and claimed that the security of which is based on the difficulties of computing both integer factorization and discrete logarithm. However, at the same year, Li and Xiao demonstrated that Shao’s schemes are insecure are not based on any hard problem. Recently, Wei proposed two “Digital Signature Schemes Based on Two Hard Problems” to improve Shao’s schemes, and showed that it can resist Li and Xiao’s attack. We show that neither scheme is as secure as the author claim. One can forge a valid signature of an arbitrary message by using Pollard and Schnorr’s method without solving the discrete logarithm problem or the factorization hard problem.

  • 关键词:

    digital signature, factorization problem, discrete logarithm problem, two hard problems

国家哲学社会科学文献中心版权所有