Abstract
Laih and Kuo proposed two efficient signature schemes based on discrete logarithms and factorization. Recently, Li et al. improve one of their schemes in order to use fewer keys for a signing document. In this paper, we shall prove that their improvement of Laih and Kuo's signature scheme is insecure. Moreover the improved signature scheme in fact is not based on two cryptographic assumptions simultaneously, and forging a signature on any message would not need to solve any difficult problems.
| Original language | English |
|---|---|
| Pages (from-to) | 501-505 |
| Number of pages | 5 |
| Journal | Applied Mathematics and Computation |
| Volume | 166 |
| Issue number | 3 |
| DOIs | |
| State | Published - 26 Jul 2005 |
| Externally published | Yes |
Keywords
- Cryptanalysis
- Cryptography
- Digital signature
- Discrete logarithms
- Factoring