A comparative study of ElGamal based digital signature algorithms

Issue title: Selected papers from the International Conference on Computer Science, Software Engineering, Information Technology, e-Business, and Applications, 2004

Guest editors: Narayan C. Debnath

Article type: Research Article

Authors: Haraty, Ramzi A.^{a; *} | El-Kassar, A.N.^b | Shebaro, Bilal M.^a

Affiliations: [a] Lebanese American University, Lebanon | [b] Beirut Arab University, Lebanon

Correspondence: [*] Corresponding author. E-mail: [email protected].

Abstract: A powerful and practical public-key and digital signature scheme was produced by ElGamal. ElGamal public-key and digital signature scheme were modified from the domain of natural integers, Z, to the domains of Gaussian integers, Z[i], and polynomials over finite fields, F[x]. We implement the classical and modified ElGamal digital signature scheme to compare and to test their functionality, reliability and security. To test the security of the algorithms we use a famous attack algorithm called Baby-Step-Giant algorithm which works in the domain of natural integers. We enhance the Baby-Step-Giant algorithm to work with the modified ElGamal digital signature algorithms.

Keywords: ElGamal digital signature, testing, evaluation, Baby step giant algorithm

DOI: 10.3233/JCM-2006-6S112

Journal: Journal of Computational Methods in Sciences and Engineering, vol. 6, no. s1, pp. S147-S156, 2006