A comparative study of ElGamal based digital signature algorithms

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.