Abstract
He and Kiesler proposed two modified schemes to enhance the security of El Gamal's signature scheme. They claimed to have remedied two technical problems of El Gamal's signature scheme, and the security of the second scheme is based on the difficulty of solving both factoring and discrete logarithms simultaneously. The paper shows that both modified schemes, in fact, do not solve the first technical problem. Besides, if one has the ability to solve the discrete logarithms, one can break the second modified signature scheme.
Original language | English |
---|---|
Pages (from-to) | 370-372 |
Number of pages | 3 |
Journal | IEE Proceedings: Computers and Digital Techniques |
Volume | 142 |
Issue number | 5 |
DOIs | |
Publication status | Published - 1995 Sept |
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Hardware and Architecture
- Computational Theory and Mathematics