Title :
Enhancing the security of El Gamal´s signature scheme
Author :
He, J. ; Kiesler, T.
Author_Institution :
Comput. Sci. Telecommun. Program, Missouri Univ., Kansas City, MO, USA
fDate :
7/1/1994 12:00:00 AM
Abstract :
The paper proposes the use of more than one hard problem in the design of cryptographic protocols to enhance their security. Specifically, both the discrete logarithm problem and the factorisation problem are embedded in the process of signing to enhance the security of the original El Gamal signature scheme
Keywords :
cryptography; protocols; El Gamal´s signature scheme; cryptographic protocols; data security; discrete logarithm problem; factorisation problem; hard problem;
Journal_Title :
Computers and Digital Techniques, IEE Proceedings -
DOI :
10.1049/ip-cdt:19941272