THE EFFICIENT DIGITAL SIGNATURE TECHNIQUE WITH MESSAGE RECOVERY BASED ON ELGAMAL

The digital signature scheme allows authenticating documents with non-repudiation and data integrity. The problem of ElGamal digital signature scheme is that, the message recovery is not provided and its security is constantly being challenged. The security disadvantage of the original ElGamal algorithm is that, it has only one random number. In order to improve its security, the proposed scheme adds one more random number. The security of the proposed signature scheme is the same with the ElGamal signature scheme which is based on the difficult computable nature of discrete logarithm over finite fields. In this paper, the algorithm is proposed to enhance the security and usage of more random number to make algorithm more complicated, which can also make the link between the random number and the key more complicated. The attacks like forgery and parameter reduction are also not applicable on it. The length of the message is independent, so it is suitable for long messages.