The Digital Signature Schemes Based on Two Hard Problems: Factorization and Discrete Logarithm

摘要

This paper gives the survey of digital signatures, which are based on two hard problems: (1) factorization (FAC) and (2) discrete logarithms (DL). In 1994, L. Harn developed digital signature which is based on this two hard problems. Z. Shao showed the drawback of L. Harn's scheme and proposed his new scheme. There are various schemes which are based on these two hard problems, because attacker cannot solve both the problems simultaneously.