A comparative study of ElGamal based digital signature algorithms

Authors:
Ramzi A. Haraty;A. N. El-Kassar;Bilal M. Shebaro
Affiliations:
Lebanese American University, Lebanon;Beirut Arab University, Lebanon;Lebanese American University, Lebanon
Venue:
Journal of Computational Methods in Sciences and Engineering - Selected papers from the International Conference on Computer Science, Software Engineering, Information Technology, e-Business, and Applications, 2004
Year:
2006

Citing 2
Cited 0

Handbook of Applied Cryptography

Handbook of Applied Cryptography
Attacking ElGamal based cryptographic algorithms using Pollard's rho algorithm

AICCSA '05 Proceedings of the ACS/IEEE 2005 International Conference on Computer Systems and Applications

Quantified Score

Hi-index	0.00

Visualization

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.