Security

Comments on Wei's Digital Signature Scheme Based on Two Hard Problems

Download Now Free registration required

Executive Summary

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.

  • Format: PDF
  • Size: 161.8 KB