Abstract

Nowadays, RSA and ElGamal algorithms are the most effective public key cryptosystems. These systems are used to achieve user's authenticity and ensure data confidentiality. Signature algorithms allow a third-party to confirm the authenticity of a message that was sent over an insecure channel. RSA signature algorithm depends on the difficulty of factoring large composite numbers and ElGamal signature algorithm depends on the difficulty of computing discrete logs over large prime modulus. In this paper, we enhance the performance of ElGamal signature algorithm through designing a parallel design for both signature and verification processes. The analysis shows that the deployment of proposed parallel design significantly decreases the execution time of ElGamal algorithm.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call