Digital Signature Scheme Based on Two Hard Problems

In 1998, Shao Proposed two digital signature schemes based on factoring and discrete logarithms. At the same year, Li and Xiao showed that Shao's schemes are insecure are not based on any hard problem. This paper modifies Shao's schemes. Two new schemes whose security is based on both factorization and discrete logarithms are proposed.