Security of He and Kiesler's signature schemes

Research output: Contribution to journalArticlepeer-review

10 Citations (Scopus)

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 languageEnglish
Pages (from-to)370-372
Number of pages3
JournalIEE Proceedings: Computers and Digital Techniques
Volume142
Issue number5
DOIs
Publication statusPublished - 1995 Sept

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Hardware and Architecture
  • Computational Theory and Mathematics

Fingerprint

Dive into the research topics of 'Security of He and Kiesler's signature schemes'. Together they form a unique fingerprint.

Cite this