comparative study between Asymmetric Algorithms, Rivest Shamir

Adleman, Elliptic Curve cryptography and El-Gamal Algorithms

Abstract— Web and information security should be guaranteed for all clients. Consequently, security is an eminent issue when
introducing data to networks. Information is not adequately protected in the way that it ought to be in the modern, globalized world.
One of the most useful aspects of security is cryptography. While imparting colossal amounts of data, cryptography ensures a free
and dependable transaction between the source and the recipient. In addition, the records that were sent and encoded by the source
can only be decoded by the legitimate recipient. To be able to provide these organizations with security, cryptography plays an
essential role. With stacks of data of varying lengths, we examine encryption in this paper despite the decoding time of other
calculations. Without skipping a beat, this work presents the major standards of cryptography: encryption and unscrambling
undertakings. Likewise, it investigates the three most notable computations: El-Gamal, Rivest, Shamir, Adleman. (RSA), and the
Elliptic Curve Our relationship relies totally upon the key size time frame that influences the successively period. We will
occasionally conclude our investigation targeting specifically on the restrictive effects of the Rivest, Shamir, Adleman. (RSA) and
elliptic curve cryptography based on calculations.
Keyword— Encryption, decryption, key, cryptography, RSA, Elliptic Curve.

I. INTRODUCTION

Cryptography is an approach to keeping and exchanging data that uses a specific format that only the
intended recipients can read and process. The digital encryption of the information prevents perpetrators
from reviewing confidential messages. As internet access and other media-related gadgets become
increasingly prevalent, digital safety gains in significance. Cryptography is a security tool utilized for
obtaining messages in emails, information about credit cards (Hohenberger and Waters, 2018), business
data, and any other important information passed through an array of channels and areas such as
networked firms and remote organizations (Das & Goldsztein, 2023). Cryptography can be classified
into two primary groups: symmetrical key contexts and asymmetrical key systems, but various
characteristics can also distinguish it. The primary goals of cryptography are secrecy, accessibility,
access control, honesty, non-renunciation, and verification(Adeniyi, Falola, Maashi, Aljebreen, &
Bharany, 2022). El-Gamal, Rivest, Shamir, Adleman. (RSA), and ECC are probably the most well-
known encryption and unscrambling techniques. The execution times and key sizes of these procedures
are all unique. We propose introducing three significant cryptographic calculations in this paper. It is
important to note that this paper is organized as follows after we present the main cryptographic
concepts: The El-Gamal calculation and RSA are presented and examined in the following section. In
the third section, we compare and contrast the elliptic Curve cryptography and Rivest, Shamir, Adleman.
(RSA)s. Finally, we discuss the results and wrap up.

Cryptography is a technique for effectively distorting data so that legitimate competitors can approach
it. Accepting this cycle requires both art and science. There are two types of this cryptography:
symmetric and topsy-turvy cryptosystems, as shown in Figure 1. The grouping is determined by the key
used in encryption and unscrambling software. A few concepts and expressions used in the cryptographic
environment are depicted in this section. Age range: This is the stage at which plain texts are changed
over totally to encoded texts given the turn of events and control of number-crunching that provoked the
creation of encryption (Hammawa, Bisallah, & Abdulrahman, 2023)Unscrambling is the opposite,
converting scrambled instant messages into ones that can be read. The recipient is able to read and
comprehend the text when it is written in human language or is understandable. Figures 1 and 2 show
how encryptions are done in a cryptosystem using single and twofold keys.

1
.

Fig. 1. The general idea of symmetric-key cryptography [4]

Fig. 2. The general idea behind asymmetric-key cryptography [4]

II. Rivest, Shamir, Adleman. (RSA) ALGORITHM

Rivest, Shamir, Adleman. (RSA) is an encryption calculation that involves different keys for figure text
and translation cryptography. Rivest Shamir Adleman (RSA) was founded in 1978 by teachers Leonard
Adleman, Adi Shamir, and Ron Rivest at a Massachusetts lab (Chinnasamy & Deepalakshmi, 2018).
RSA is named a topsy-turvy encryption framework since it utilizes two particular key code messages
and translates instant messages. The code message key is utilized for encryption and is known by both
the source and the collector, though the translated message is utilized for decoding. The encryption key
is known as the public key, while the decoding key is known as the confidential key. Unbalanced
encryption utilizes two keys, which makes it safer than symmetric encryption, which involves just a
single key for both encryption and unscrambling. At the point when instant messages are encoded
utilizing the Rivest, Shamir, Adleman. (RSA) calculation, it is so hard for programmers to anticipate what
ought to be utilized to unscramble the instant message (Hammawa et al., 2023). These are the stages in
creating and carrying out the RSA calculation, as follows: The initial step is to pick two indivisible
numbers aimlessly, j and k. Then, at that point, the augmentation of J and k, which is the modulus for
our public and confidential keys, is called n. Then, an encryption e will be painstakingly picked which
is a code key and isn't a component of (j − 1) (k − 1). From that point forward, an interpret key d is
produced through estimation as following (de) mod (j1) (k1) = 1. The encryption can be determined as
C = (Me) mod n, where C is the scrambled ciphertext and M is the plain instant message. Finally, the
decoding will be expected as M = Cd mod n. To guarantee an elevated degree of safety in our
cryptography, the key size should be more prominent than 1024 pieces; this makes recognizable proof
troublesome (Al Mamun, Mahmood, & Amin, 2021).
2
 EL-GAMAL ALGORITHM
The El-Gamal calculation is likewise a halter kilter cryptosystem with high encryption and
unscrambling strength. The encryption arrangement of this calculation contrasts with signature
confirmation. The value of the use of El Gamal's requirement for haphazardness gives a similar
structure in the order to scramble inside the public key and confidential key cryptosystems (Roy & Das,
2018). Subsequently, the cryptosystem of El-Gamal isn't equivalent to a signature check, and we can
make marks under El-Gamal. The main trap of El-Gamal is the requirement for irregularity and the
sluggish speed of handling during encryption and unscrambling, as well as the message extension,
which occupies a ton of room after encryption (Roy & Das, 2018). However, the development is
irrelevant when it is utilized on secret keys.

COMPARISON EL-GAMAL ALGORITHM ANDRSA

El-Gamal calculations have been applied to information encryption and computerized marks. The safe
calculation involves the issue of disparity logarithms in limited areas. In this cryptography, we initially
pick an enormous indivisible number and afterward pick a variable number g and x at irregular. where
g p and x p, while Y = g x(mod p). Similar investigations of the El-Gamal and RSA calculations have
been done in light of safety strength and time of execution for encryption and decoding. The examination
dissected the RSA calculation and contrasted it and the El-Gamal calculation (Islam, Islam, Islam, &
Shabnam, 2018). The outcomes show El-Gamal produces more mind-boggling figure instant messages.
It additionally requires more investment as it makes more than one public key; in encryption and
decoding, El-Gamal is slow. The advanced mark security on El-Gamal has been tested and needs
consistent redesigning as fraudsters make endeavors to hack it (Mathur, Gupta, Goar, & Choudhary,
2018). El-Gamal's disservices are displayed in table 1. The primary issue in El-Gamal is the utilization
of only one arbitrary number. Examination showed a significant impediment: the code text is two times
the length of the plaintext. And that implies it occupies more room during the encryption cycle contrasted
with RSA, as displayed in Table 2.

TABLE 1 ON Rivest, Shamir, Adleman. (RSA) AND EL-GAMAL ALGORITHMS

S.NO Factors RSA El-Gamal
1 invented Introduced year 1978 Introduced year 1985
2 Key Length ≥1024 bytes 1024 bytes
3 Cryptography Asymmetrical Cryptography Asymmetrical
Cryptography
4 Security Vulnerability Timing Attack Meet-in-The middle
Attack
5 Software Speed Firm Firm
6 Scalability Nil active
7 Encryption decryption Series of key applied for the cipher text Series of key applied for
Key Used and Decipher text messages activities the Encryption and
Decryption activities
8 Power Very Low Very Low
Consumption

3
 9 Hardware and Effective Effective
Software
Implementation

Table 2 encryption cycle contrasted with RSA

No Algorithm Encryption Decryption

1 RSA Key generator:s The private key (d,
p: 71 q: 41 e: 51 d: N): ( 2526, 2911)
2526
The public key (e, N) : (51, 2911)
Chipertext :
Private Key (d, N) :
212 254 456 465 854 34 442 456 677 765 435 432 234 433 876
(2526, 2911) 965 769 650 664 879 907 905

Result (Chipertext): Result (Plaintext):

212 254 456 465 854 34 442 456 677
Effectively distorting data
765 435 432 234 433 876 965 769 650
664 879 907 905

Time : 0.14 millisecond Time : 0.24 millisecond

2 ElGamal Key Generator: Private Key (x,p) :

p : 109 g : 68 x : 54 k (54, 109)
: 60 y : 122
Public Key (y, g, p) : (122, 68, 109)
Chipertext:
Private Key (x, p) : (54,
243 435 689 103 365 657 897 655
109)
456 333 564 643 754 793 476 51 455 664
765 754 345 765 78 953 757 646 382 273
Result :
632 482 237
243 435 689 103 365 657 897 655
456 333 564 643
754 793 476 51 Result (Plaintext):
455 664 765 754 Effectively distorting data
345 765 78 953
757 646 382 273
632 482 237 Time: 4.32 millisecond

Time: 3.26 milisecond

III. ELEPTIC CURVE ALGORITHM

In 1985 and 1987, two experts, Neal Koblitz and Victor S. Mill operator, freely presented Elliptic Curve
cryptography (Hammawa et al., 2023). This cryptography framework changes a numerical world
delinquent into an EE, which is a material PC calculation. As a general rule, public key cryptography
brings the intricacy of the issue into a cryptosystem. Elliptic Curve Cryptography (ECC) sticks to the
essential logarithmic construction of elliptic Curve s over a limited field. Figure 3 portrays various
plates of an elliptic curve (Dixit, Gupta, Trivedi, & Yadav, 2018).

Elliptic Curve Cryptography (ECC) Algorithm

Elliptic Curve Cryptography (ECC) algorithm do generate keys and also exhibits encoding, and
decoding keys.

Steps in Key generation in Elliptic Curve Cryptography (ECC)

4
 Step I: An elliptic curve Equation (a, b) is picked through constraints a, b, and q, where q is a prime
number >3, or an integer of the form 2m.
Step II. Picks G(x, y) - a global point on elliptic curve whose order is large value n.
User A Key Generation
Step I. Pick out a private key, VA; where, VA < n
Step II. Computes the public key, PA(x, y) PA(x, y) = VA × G(x, y).

User B Key Generation

Step I. Pick out a private key, VB; where, VB < n.
Step II. Computes the public key, PB(x, y); PB(x, y) = VB × G(x, y).

Compute Secret Key by User A

Step I. SK(x, y) = VA × PB(x, y)
Compute Secret Key by User B
Step I. SK(x, y) = VB × PA(x, y).
Encryption by A using B Public Key
Step I. A typed message Pm(x, y) and picked a random positive integer ’k’ and 1 < k < q
Step II. The Ciphertext, Cm((x, y),(x, y)); = ((k × G(x, y)), (Pm(x, y) + k × PB(x, y))).
Decryption by B using his own Private Key
Step I. The Ciphertext is Cm((x, y),(x, y))
Step II. The Plaintext is Pm(x, y); = (Pm(x, y) + k × PB(x, y)) - (k × VB × G(x, y)) = Pm(x, y).

VI. COMPARISON BETWEEN ECC AND RSA ALGORITHMS

The utilization of a mystery key that isn't spoken with the ciphertext is the fundamental benefit of the
RSA calculation. This makes it arduous to be perceived by the programmers. The computerized
signature delivered by the public key of RSA gives it a controlling element (Merkepci, Abobala, &
Allouf, 2023). A computerized mark is a web-based signature that gives two primary conclusions:
first, the message is shipped off the approved individual without changes, and second, the
independence of the individual who is sending the message is sure. However ECC is quicker than
RSA in the encryption process. That is the fundamental benefit of ECC over other lopsided key
calculations like RSA key trade. It likewise utilizes more limited key ranges to guarantee that similar
degrees of safety are kept up with. For example, a 160-piece key in ECC is estimated to be safer than
a 1024-cycle key in the RSA calculation. Aside from this, ECC is especially suitable for
radiocommunication. Elliptic Curve Cryptography has turned into the cryptographic ideal for
organizations and specialized gadgets because of its piece size and productivity help. For better and
more grounded security of information, greater key sizes are required, and that implies all the more
above on the figuring frameworks. By and large, ECC is more proficient during the encryption time
frame than RSA, as displayed in Table3

5
 Fig. 3. Three adding cases in an elliptic curve

TABLE 3
Rivest, Shamir, Adleman. (RSA) And ECC Comparison
RSA ECC
1,024 128
3,072 384
15,360 512
19,456 1,152
19,456 3,456

VII. CONCLUSION
This exploration is a study of the primary significant cryptographic calculations like ECC, El-Gamal,
and RSA. These calculations should be concentrated on to be looked at. Examinations demonstrate that
the expense of transmission is gigantically decreased in ECC. The result exhibits the convenience of
ECC execution. We researched the security of these calculations since they are generally utilized.

REFERENCES

Adeniyi, E. A., Falola, P. B., Maashi, M. S., Aljebreen, M., & Bharany, S. (2022). Secure sensitive data sharing using RSA and ElGamal
cryptographic algorithms with hash functions. Information, 13(10), 442.
Al Mamun, S., Mahmood, M. A., & Amin, M. A. (2021). Ensuring Security of Encrypted Information by Hybrid AES and RSA Algorithm
with Third-Party Confirmation. Paper presented at the 2021 5th International Conference on Intelligent Computing and Control
Systems (ICICCS).
Chinnasamy, P., & Deepalakshmi, P. (2018). Improved Key Generation Scheme of RSA (IKGSR) Algorithm Based on Offline Storage
for Cloud Advances in Big Data and Cloud Computing (pp. 341-350): Springer.
Das, R., & Goldsztein, G. (2023). Mathematics Behind the RSA Algorithm. Journal of Student Research, 12(1).
Dixit, P., Gupta, A. K., Trivedi, M. C., & Yadav, V. K. (2018). Traditional and Hybrid Encryption Techniques: A Survey Networking
Communication and Data Knowledge Engineering (pp. 239-248): Springer.
Hammawa, M., Bisallah, H., & Abdulrahman, A. (2023). Enriching Information Security via Hybrid of New Expand Rivest Shamir
Adleman and Data Encryption Standard Cryptosystem. Journal of Applied Sciences and Environmental Management, 27(1),
155-160.
Islam, M. A., Islam, M. A., Islam, N., & Shabnam, B. (2018). A Modified and Secured RSA Public Key Cryptosystem Based on “n” Prime
Numbers. Journal of Computer and Communications, 6(03), 78.
Mathur, S., Gupta, D., Goar, V., & Choudhary, S. (2018). Implementation of Modified RSA Approach for Encrypting and Decrypting Text
Using Multi-power and K-Nearest Neighbor Algorithm Networking Communication and Data Knowledge Engineering (pp. 229-
237): Springer.
Merkepci, M., Abobala, M., & Allouf, A. (2023). The Applications of Fusion Neutrosophic Number Theory in Public Key Cryptography
and the Improvement of RSA Algorithm. Fusion: Practice and Applications.
Roy, D., & Das, P. (2018). A Modified RSA Cryptography Algorithm for Security Enhancement in Vehicular Ad Hoc Networks. Paper
presented at the Proceedings of the International Conference on Computing and Communication Systems.