RSA vs ElGamal: A Comparison of Asymmetric Encryption Algorithms

Introduction
RSA algorithm is considered to be an
asymmetric algorithm. The algorithm tends
to work on two different keys that is public
and private key. ElGamal Algorithm tends to
provide a proper kind of alternative to RSA
which is needed for public key encryption.
The overall security of ElGamal algorithm
mainly depends on the issues computing the
degree logs in the given prime modules.
References
•Alam, K., Alam, K.R., Faruq, O. and
Morimoto, Y., 2016, January. A
comparison between RSA and
ElGamal based untraceable blind
signature schemes. In Networking
Systems and Security (NSysS), 2016
International Conference on (pp. 1-4).
IEEE.
•Nwe, T.Z. and Phyo, S.W., 2014.
Performance Analysis of RSA and
ElGamal for Audio Security.
International Journal of Scientific
Engineering and Technology Research,
3(11), pp.2494-2498.
•Siahaan, A.P.U., 2018. Comparative
Analysis of RSA and ElGamal
Cryptographic Public-key Algorithms.
•Abdullah, M.N. and Al-Chalabi, A.M.,
2016. Performance Assessment of RSA,
ElGamal and Proposed DHOTP for
File Security in Pervasive Computing
Environment. International Journal of
Advanced Research in Computer and
Communication Engineering, 5(1).
•
Analysis
RSA encryption is public key technology which has
been developed by Data Security of RSA. The
algorithm of RSA is based on large number of factors
for very large numbers. Depending on RSA algorithm,
prime factorization is mainly used as a tarp door for
encryption. RSA takes huge amount of time and
processing power. ELGamal ecosystem is totally based
on problems of Discrete Logarithm problem. It aims to
derive both strength which can be calculated from
discrete logarithm. It can not be found in the given
practical time frame of number. In the inverse option
the whole power can be calculated in much easy way.
RSA vs ElGamal
ElGamal mainly depends on issues of
computational functionality which is
needed for solving some of the discrete
logarithm problems. On the Contrary,
RSA depends on computational
algorithm which is needed for
factoring large prime numbers. RSA
encryption is considered to be much
faster than RSA decryption.
 RSA is totally based on factoring
whereas ElGamal is totally based on
some of the discrete logarithm issues
in the given cyclic group.
Both the given algorithm is based on
similar kind of keys which can be
broken down into similar kind of
approaches.
ElGamal can be easily implemented
by the help of elliptical curve. It
mainly focus increasing the overall
efficiency and reducing the key size.
RSA cannot be more efficient in
nature.
RSA is considered to be
standardized and the implementation
which is mutually compatible in
nature. ElGamal comes up with wide
value of implementation which is
represented in algebraic group.
RSA is known to be deterministic
algorithm while ElGamal aims to
provide semantic security.
RSA comes up with an
independent key, while ElGamal
comes up with a System parameter.
RSA aims to provide only
onewayness while ElGamal aims to
provide semantic security.
Both RSA and ElGamal makes use
of modular arithmetic. RSA makes
use of different kind of arithmetic
structure while ElGamal makes use
of same arithmetic structure for
every key within the system
Conclusion
From the above discussion, it can
be easily concluded that the RSA
is more efficient for encryption
while ElGamal is efficient for
decryption. RSA is much less
efficient for decryption while
ElGamal is more efficient for
decryption. Much length keys are
needed in RSA while short keys
are required. RSA is widely used
and accepted. ElGamal is not
popular in the current market.
Comparison