A Comparative Study of RSA and ELGAMAL Cryptosystems

Abstract

Purpose: In this research, a comparative analysis of the RSA and ELGAMAL algorithms is presented using their encryption and decryption speed with different key sizes. ElGamal and RSA are two popular public-key cryptographic algorithms that depend on the mathematical difficulty of computing discrete logarithms in finite fields and factoring large integers, respectively.

Methodology: In this study, the speed at which messages of various sizes can be encrypted and decrypted using various key sizes is used to gauge how well these algorithms work.

Findings: RSA usually outperforms ElGamal in terms of encryption and decryption speed, according to the results. However, as the key sizes grow, the performance gap between the two algorithms narrows.

Unique Contribution to Theory, Policy and Practice: These findings can aid in selecting the appropriate algorithm and key size for different applications that require secure communication and data encryption.