2019 6th IEEE International Conference on Cyber Security and Cloud Computing (CSCloud)/ 2019 5th IEEE

International Conference on Edge Computing and Scalable Cloud (EdgeCom)

A Survey on Cryptography: comparative study

between RSA vs ECC Algorithms, and RSA vs
El-Gamal Algorithms
1st Fatma Mallouli 2nd Aya Hellal
Deanship of Preparatory Year and Supporting Studies Deanship of Preparatory Year and Supporting Studies
Imam Abdulrahman Bin Faisal University Imam Abdulrahman Bin Faisal University
Dammam, Saudi Arabia Dammam, Saudi Arabia
[email protected] [email protected]

3th Nahla Sharief Saeed 4rd Fatimah Abdulraheem Alzahrani

Community college Deanship of Preparatory Year and Supporting Studies
Imam Abdulrahman Bin Faisal University Imam Abdulrahman Bin Faisal University
Dammam, Saudi Arabia Dammam, Saudi Arabia
[email protected] [email protected]

Abstract—Internet security and data protection should be regarding other attributes. The main objectives of cryptography
guaranteed for all users. Therefore, security is a major concern are confidentiality, authentication, integrity, Non repudiation,
when exposing information to networks. In todays world, the access control, and availability. RSA and ECC , El-Gamal are
information is never enough protected the way it should be. Cryp-
tography is one of the most effective and efficient components of of the most famous techniques used to perform encryption
network security. Cryptography is a technique to apply ensure and decryption. These techniques have different key sizes,
the secure and reliable transaction between the sender and the and eventually different execution time. In the present pa-
receiver when transferring unintelligible information. Moreover, per we propose to present three majors algorithms used for
only the authorized receiver can have the right to decrypt the cryptography. Note that, we introduce the main concepts used
information that was sent and encrypted by the sender. The
cryptography plays an essential role in order to provide security in cryptography, the remainder of this paper is organized as
to these networks. In this paper, we observe encryption as well follows: in the second section, we introduce and compare
as decryption time of different algorithms with the random size between El-gamal algorithm and RSA. In the third section,
of data packets. Firstly, this work introduces the fundamental we introduce elliptic curve algorithm and we compare it with
concepts of Cryptography: encryption and decryption operations. RSA. Finally, we discuss results and we conclude.
Secondly, compares between the most popular algorithms RSA ,
El-Gamal and Elliptic Curve (ECC). Our comparison is based on A. Cryptography
key size length that affects the running time. Finally, we conclude
our survey by focusing on the different outcomes between the Cryptography is simply hiding information in a systematic
RSA and Elliptic curve algorithms. manner such that only authorized parties to have access to
Index Terms—Encryption, decryption, asymmetric key, sym- the right information. Doing so can be considered as an art,
metric key, cryptography, RSA, Elliptic Curve.
but it is a science. Cryptosystem broadly classified into two
major categories, first is symmetric (Figure 1) and other is
I. I NTRODUCTION
asymmetric (Figure 2) based on the concepts of the key.
Cryptography [1] [2], is a technique to store and transmit
data in a particular format in a way only intended users B. Concepts Used in Cryptography
can read and process. The encryption of the data prevents The following paragraph is a description of some of the
attackers from reading private messages. Electronic security concepts used in cryptography [5].
was becoming more and more essential as the Internet, and Encryption: The process of encoding plain text messages into
other media devices become more pervasive. Cryptography ciphertext messages is called encryption.
is a security tool utilized to secure email messages, Credit Decryption: The reverse process of transforming ciphertext
Card data [3], corporate information, and any relevant data messages back to plain text is called decryption.
transmitted through all types of media and the various fields Plain Text: The raw communication written or said in any
like wired networks and wireless networks. The cryptography human language. It takes the form of plain text. It is read
is classified into two major categories: Symmetric Key Sys- and understood or heard and understood by the sender, the
tems and Asymmetric Key Systems, but it can be classified recipient, or by any other third party that can access that

978-1-7281-1661-7/19/$31.00 ©2019 IEEE 173

DOI 10.1109/CSCloud/EdgeCom.2019.00022
Authorized licensed use limited to: Amrita School of Engineering. Downloaded on November 28,2023 at 06:26:47 UTC from IEEE Xplore. Restrictions apply.
 • Non-Repudiation: while the sender and receiver agree that
acknowledge the delivery of the report.
• Authentication: Are the phenomena to offer identity to a
special person in order to break special resource using
keys.
• Confidentiality: is the ultimate objective of encryption
and decryption that ensure that only the receiver of the
message is the cipher-key owner.
II. RSA ALGORITHM
RSA is an encryption algorithm, and it is an abbreviation
of Rivest Shamir Adleman ,which was invented by professors
Leonard Adleman ,Adi Shamir, and Ron Rivest in Mas-
Fig. 1. The general idea of symmetric-key cryptography [4]
sachusetts lab (MIT) in the year 1978 [7]. RSA is using the
asymmetric encryption key that has two different keys, one
is a public key which is known by everyone and will be
using for the encryption process. While the other key is a
private key that will be used for the decryption process of
the encrypted message. Asymmetric encryption is unlike the
symmetric encryption which is using only one key for both the
encryption and decryption processes. The primary advantage
of the asymmetric encryption key is to have strong encryption
that will make the decryption of the original text difficult
and cannot be predicted by hackers . There are several steps
to implement the RSA algorithm on a plain text. Adki and
Hatkar [8] have summarized the steps of RSA algorithm as the
following; first, two prime numbers a and b should be selected.
Then, there should be modulus for the public, and private keys
called n that is multiply by b. Next, an e should be selected
which is a public key and is not a factor of (a − 1)(b − 1).
After that, a private key called d should be calculated as the
Fig. 2. The general idea behind asymmetric-key cryptography [4]
following (d ∗ e) mod (a − 1)(b − 1) = 1. The encryption will
be calculated as C= Me mod n, where C is the ciphertext, and
message. M is the original text. Lastly, the decryption will be calculated
Cipher Text: Cipher means a code or a secret message. When as M = Cd mod n, where C is the ciphertext, and M is the
a plain text is codified using any suitable scheme the resulting original text. Also, to ensure a high level of security the key
message is called a ciphertext. size should be greater than 1024 bits; to make it difficult for
Key: the key is one of the most important parts of performing the hacker to identify [9]. The following example (Example1)
encryption and decryption. The choice the key used is what will explain better the process.
makes the process of cryptography secure. Example1: To demonstrate the RSA public key encryption
Symmetric key: also known as secret key cryptosystems. Only algorithm, let’s start it with 2 smaller prime numbers 5 and 7.
one key is used in both encrypting and decrypting processes. Generation the public key and private key with prime numbers
Asymmetric key: contrary to the Symmetric, Asymmetric use of 5 and 7 can be illustrated as:
two different keys: one for encryption and one for decryption. • Given p as 5
This system is also known as a public key cryptosystem. • Given q as 7
• Compute n = p ∗ q : n = 5 ∗ 7 = 35
C. Need of Cryptography • Compute m = (p − 1) ∗ (q − 1) : m = 4 ∗ 6 = 24
Cryptography [6] is used to achieve many goals, and some • Select e, such that e and m are coprime numbers:
of the goals are the following list shows: the goals are the • e=5
following list shows: • Compute d, such that d*e mod m = 1: d = 29
• Access Control: this means the unique confirmation of • The public key {n, e} is = {35, 5}
the group with correct authentication that is eligible to • The private key {n, d} is = {35, 29}
log into the delivered message. • With the public key of {35, 5}, encryption of a cleartext
• Data Integrity: is the process in which the access of M represented as number 23 can be illustrated as:
modulating the database belongs to a specific group or • Given public key {n, e} as {35, 5}
person. • Given clear text M represented in number as 23

174

Authorized licensed use limited to: Amrita School of Engineering. Downloaded on November 28,2023 at 06:26:47 UTC from IEEE Xplore. Restrictions apply.
 • Divide B into blocks: 1 block is enough
• Compute encrypted block C = M ∧ e mod n:
C = 23 ∧ 5 mod 35 = 6436343 mod 35 = 18 The ciphertext
C represented in number is 18 With the private key of 35,
29, decryption of the cipher text C represented as number
18 can be illustrated as: Given private key n,e as 35,29 Given
ciphertext C represented in number as 18 Divide C into blocks:
1 block is enough Compute encrypted block:
M = C ∧ d mod n :
M = 18 ∧ 29mod35 = 18 ∗ 18 ∧ 28 mod 35
= 18 ∗ (18 ∧ 4) ∧ 7 mod 35 Fig. 3. Three adding cases in an elliptic curve
= 18 ∗ (104976) ∧ 7mod35
= 18 ∗ (104976 mod 35)∧ mod 35
= 18 ∗ (11) ∧ 7 mod 35 random number is used. Also analysis showed another major
= 18 ∗ 19487171 mod 35 disadvantage: the cipher text is twice as long as the plaintext.
= 350769078 mod 35 El-Gamal Algorithm is comparable to RSA as showed in
= 23 Table2.
The clear text M represented in number is 23.
TABLE I
III. EL-GAMAL ALGORITHM S UMMARY TABLE O N S YMMETRIC A LGORITHMS O F RSA A ND
E L -G AMAL
The El-Gamal algorithm [10] is known as a asymmetric
S.NO Factors RSA El-Gamal
cryptosystem. It is so powerful in terms of encrypting and 1 Developed 1978 1985
decrypting. This algorithm present the same form in order to 2 Key Length >1024 bits 1024 bits
encrypt within the public key and private key environment. Value
3 Type of Algo- Asymmetric Asymmetric
Therefore, encryption is not the same as signature verifica- rithm
tion. signature creation depends on the El-Gamal signature 4 Security Timing Attack Meet-in-The
algorithm. The main disadvantage of El-Gamal is the need for Attacks middle Attack
randomness, and its slower speed (especially for encrypting 5 Simulation Fast Fast
Speed
and decrypting).the main disadvantage that present o El-Gamal 6 Scalability No Scalability Good scalabil-
algorithm is that the use expensing the message by one or occurs ity
two factors, which take place during encryption. Consequently, 7 Key Used Different Different
key used key used
such message expansion is negligible if the cryptosystem is for Encrypt for Encrypt
used only for exchange of secret keys El-Gamal encryption. and Decrypt and Decrypt
Process Process
IV. COMPARISON EL-GAMAL ALGORITHM AND 8 Power High Low
RSA Consumptin
9 Hardware and Not very effi- Faster and effi-
El-Gamal is not semantically secure. El-Gamal algorithms Software Im- cient cient
[10] can not only be used in data encryption, but in digital plementation
signature and the security relies on the problem of divergence
logarithm in finite domains. Firstly, choose a prime number
p, and two random number g, x, where g < p and x < p, V. ELEPTIC CURVE ALGORITHM
calculate Y = g ∧ x( mod p) , of which y, g, and p are Neal Koblitz and Victor S. Miller independently introduced
the public Comparison of El-Gamal and RSA algorithms has Elliptic Curve cryptography in 1985 and 1987 [13]. Elliptic
been done on the basis of security and time consumption for curve cryptography transforms a mathematical problem in to
encryption and decryption. This paper analyze that ElGamal an EE applicable computer algorithm. In general, public key
algorithm is more secure as compared to RSA algorithm cryptography brings the complex problem into a cryptosystem.
because it generates more complex cipher text and it was also Elliptic Curve cryptography (ECC) [14] is based upon the
slow because when we encrypt and decrypt it, it generates algebraic structure of elliptic curves over a finite field. Figure
more than one public keys. The research in this paper [11] 3 represents different illustrations of an elliptic curve.
presents the problem that ElGamal digital signature security Example 2: (p = 7, n = 2, a = 1, b = 6)
is constantly being challenged and increasingly becomes iseri- y 2 = x3 + x + 6
ous, an improved ElGamal comparison is proposed. Although, (Note:4 + 27 ∗ 36 = 976 = 3 mod7)
ElGamal algorithm is considered secure and reliable [12] There are 49 integer points on this “curve”
and It has the advantage of making the same plaintext that Ex: (3, 6) → 3 ∧ 3 + 3 + 6 = 36 mod 7 = 1 = 6 ∧ 2 mod 7
gives a different cipher text, each time it is encrypted. But it (4, 2) → 4 ∧ 3 + 4 + 6 = 74 mod 7 = 4 = 22 mod 7
has its own disadvantages. The main problem that only one (6, 5) → 6 ∧ 3 + 6 + 6 = 228 mod 7 = 4 = 52 mod 7

175

Authorized licensed use limited to: Amrita School of Engineering. Downloaded on November 28,2023 at 06:26:47 UTC from IEEE Xplore. Restrictions apply.
Points on the “curve” for which there are solutions: reduced in ECC. The result shows the performance of ECC
(1, 1), (1, 6), (2, 3), (2, 4), (3, 1), (3, 6), (4, 2), (4, 5), (6, 2), (6, 5) that are useful. We have surveyed these algorithms security
Note: (3, 1), (2, 3), (6, 2) are on the same line. because they are mostly used.
y = 2x + 7, y = x/3 are the same line
R EFERENCES
(7 mod 7 = 0, 1/3 is the inverse of 3 which is - 2).
[1] W. Stallings, Network Security Essentials - Applications and Standards
VI. COMPARISON BETWEEN ECC AND RSA (4. ed., internat. ed.). Pearson Education, 2010.
ALGORITHMS [2] A. Kahate, Cryptography and Network Security. Mc-
Graw Hill Education, 2013. [Online]. Available:
The primary advantage of the RSA algorithm is the use of https://books.google.com.sa/books?id=xCDZAgAAQBAJ
[3] P. S. S. H. Vikrant M. Adki, “A survey on cryptography techniques,”
a private key, which is not transmitted with the encrypted text, International Journal of Advanced Research in Computer Science and
which makes it impossible to be known by the hacker. Also, Software Engineering, 2016.
providing a digital signature by the public key in RSA give [4] http://www.ssl2buy.com/wiki/symmetric-vs-asymmetric-encryption-
what-are-differences.
it a powerful feature [5]. The digital signature can be defined [5] V. K. Mitali and A. Sharma, “A survey on various cryptography
as an online signature that will provide two main points, first techniques,” International Journal of Emerging Trends Technology in
is that the message was sent to the required person with no Computer Science, vol. 3.
[6] S. K. G. Omar G. Abood, “A survey on cryptography algorithms,”
changes, second, is that the identity of the sender is guaranteed International Journal of Scientific and Research Publications, vol. 8,
[15]. On the other hand, the main disadvantage of the RSA 2018.
algorithm is its slow processing [5]. ECC is based upon the [7] R. L. Rivest, A. Shamir, and L. Adleman, “A method for obtaining
digital signatures and public-key cryptosystems,” Commun. ACM,
algebraic structure [16] of elliptic curves over a finite field. The vol. 21, no. 2, pp. 120–126, Feb. 1978. [Online]. Available:
main advantage of ECC over other public key algorithms like http://doi.acm.org/10.1145/359340.359342
RSA, key exchange. It requires shorter key lengths to make [8] H. Adki, V. M., “A survey on cryptography techniques,” International
Journal of Advanced Research in Computer Science and Software
sure the same level of security. For example, 160 bit key in Engineering, vol. 6, 2016.
ECC is considered to be as secure as 1024 bit key in RSA. [9] S. A. Ritu Tripathi, “Comparative study of symmetric and asymmetric
Other than this ECC in particularly appropriate for wireless cryptography techniques,” International Journal of Advance Foundation
and Research in Computer, vol. 1, 2014.
communication. Elliptic Curve Cryptography has become the [10] R. S. Jamgekar and G. S. Joshi, “File encryption and decryption using
cryptographic choice for networks and communication devices secure rsa,” International Journal of Emerging Science and Engineering
due to its size and efficiency benefits. Elliptic curve cipher uses (IJESE, pp. 11–14, 2013.
[11] X. Li, X. Shen, and H. Chen, “Elgamal digital signature algorithm of
very small keys and is computationally very efficient, which adding a random number,” JNW, vol. 6, pp. 774–782, 2011.
makes it ideal for the smaller, less powerful devices being used [12] AnnapoornaShetty, S. Shetty, and K. Krithika, “A review on asymmetric
today by most individuals to access network services. Elliptic cryptography ?rsa and elgamal algorithm,” 2014.
[13] http://www.certicom.com.
curve cryptography is more complicated than RSA. As in RSA [14] R. Ansah, E.-P. Samuel, D. Attuabea, B. Adjei, B.-R. K Bawuah,
single encryption algorithms is used. ECC can be implemented and P. Antwi, “Relevace of elliptic curve cryptography in modern-day
in different ways. ECC uses arithmetic algorithms as the main technologie,” vol. 3 (2), pp. 1–10, 01 2018.
[15] A. U. Hardik Gohel, “Study of cyber security with advance concept
objective operations for high-level security functions such as of digital signature,” International Journal of Advanced Research in
encryption for gaining confidentiality and a digital signature Computer Science, vol. 6, 2015.
for authentication. ECC can be implemented in software and [16] R. Ansah, R. Boadi, W. Obeng-Denteh, and A. Y Omari-Sasu, “Review
of the birch and swinnerton-dyer conjecture,” vol. 2016, pp. 182–189,
in hardware. ECC follows generic procedure like parties agree 08 2016.
on publicly-known data items and each user generates their [17] D. M. Behrouz A Forouzan, Cryptography and Network Security.
public and private keys [9] [17] [15] [13] [18] [19]. McGraw-Hill Education, 2011.
[18] G. Shen and B. Liu, “Research on efficiency of computing kp in
Overall ECC is more efficient and secure than RSA as shown elliptic curve system,” in 2010 6th International Conference on Wireless
in Table 2. Communications Networking and Mobile Computing (WiCOM), Sep.
2010, pp. 1–4.
TABLE II [19] V. G. N. G. Sheueling Chang, Hans Eberle, “Sunmicrosystems labora-
C OMPARISON BETWEEN RSA AND ECC tories howeccworks-usletter.pdf.”

Security Bit Level RSA ECC

80 1024 160
112 2048 224
128 3072 256
192 7680 384
256 15360 512

VII. C ONCLUSION
This paper presents a survey of the main important crypto-
graphic algorithms such us ECC, El-Gamal and RSA.
These algorithms are studied in order to be compared.
Comparisons prove that the cost of transmission is enormously

176

Authorized licensed use limited to: Amrita School of Engineering. Downloaded on November 28,2023 at 06:26:47 UTC from IEEE Xplore. Restrictions apply.