Comparative Analysis of Aes and Rsa Algorithms for Data Security in Cloud Computing

: With growing technology, the cloud is becoming a center of sensitive information, making it more open to danger, especially when access to users with malicious plans increases. A huge amount of users use the cloud for various reasons, therefore, data should be safe and protected. In order to provide a safe environment, the aim of this paper is to analyze the well-known symmetric algorithm of the Advanced Encryption Standard (AES) and the Rivest–Shamir–Adleman (RSA) asymmetric algorithm based on time complexity, space, resource and power consumption, and suggest a new hybrid encryption process that is a combination of symmetric and asymmetric cryptographic methods. Based on experimental analysis, this paper proposes a AES cryptographic method as a ﬁrst choice for data encryption processes for cloud applications and data storage.


Introduction
With the growth of technology, technological infrastructure is also improving on a daily basis.Cloud computing, similarly, has completely transformed the concept of storage.There is a relatively large space available online on the cloud that seems to act as a collection of servers that are organized and arranged properly.The need of the cloud to carry out computational processes is termed as cloud computing, and can be explained as the use of remote servers wirelessly for storing, managing, and processing instead of using local servers on personal computers [1].The services that are provided by service providers to customers via the internet are mostly covered by cloud services.Software programmers and scientists have devised numerous methods for the security of data in cloud computing, leading to the advent of cryptosystems to safeguard information from falling into the incorrect hands.The methodology part of this paper delves into the intricacies of RSA and AES, two asymmetric and symmetric algorithms, and suggests a better technique for ensuring optimum cloud computing security.

Literature Review 2.1. Security of the Cloud
Cloud computing connects the individual use of hardware, software and services that are managed and controlled via another party in a very remote area [1].The system assures that the users can have access to computer resources and knowledge from any area in the world where the internet is available.Authentication, secrecy, the integrity of information transported, non-repudiation, and storage on distant servers are the security goals of cloud cryptography [2].This literature study identifies some of the major issues that cloud computing security faces.Many of these flaws are caused by bad systems, human mistakes and, in some cases, cyber bullying.With symmetric and asymmetric Eng.Proc.2022, 20, 14 2 of 6 algorithms, cryptography remains the most widely utilized tool for enhancing security measures.Figure 1 shows a brief process of cryptography.
human mistakes and, in some cases, cyber bullying.With symmetric and asymmetric algorithms, cryptography remains the most widely utilized tool for enhancing security measures.Figure 1 shows a brief process of cryptography.

Asymmetric Algorithms
Asymmetric algorithms involve public and private keys and separate into primary key and secondary key arrangements.The private key is kept secret from other parties and used for decoding while the public key is accessible to everybody and used for encoding [3].Rivest-Shamir-Adleman (RSA), elliptic-curve cryptography, and asymmetric utilities are a few examples that work with the asymmetric algorithm [4].

Symmetric Algorithms
Symmetric algorithms, on the other hand, use a single private key to encode and decode data [5].They can handle large data in terms of computation.Plaintexts are encrypted using symmetric algorithms as a block of fixed digits [1].The Advance Encryption Standard (AES) cipher text method is a more accurate and elegant cryptographic method.
According to testing results and the text files used, it has been concluded that the AES algorithm outperforms the Data Encryption Standard (DES) and RSA algorithms [6,7].

Advance Encryption Standard (AES)
The AES, known as the Advanced Encryption Standard algorithm, was made and implemented by Joan Daemen and Vincent Rijmen in 2001 [8].It has a specific block size of 16 bytes (128 bit), variant key sizes of 16 (128), 24 (192) and 32 bytes [7,8] (256 bit), and transformation rounds on a block that are specified using key sizes fixed by numbers.There are 10 rounds for the 16-byte-sized key, 12 rounds for the 24-byte-sized key, and 14 rounds for the 32-byte-sized key. Figure 2 shows a diagrammatic explanation of the AES algorithm [7,8].Encryption begins and ends by adding a round key and then applying rounds n times, where the final round is different.For decryption, the inverse process is followed.

Asymmetric Algorithms
Asymmetric algorithms involve public and private keys and separate into primary key and secondary key arrangements.The private key is kept secret from other parties and used for decoding while the public key is accessible to everybody and used for encoding [3].Rivest-Shamir-Adleman (RSA), elliptic-curve cryptography, and asymmetric utilities are a few examples that work with the asymmetric algorithm [4].

Symmetric Algorithms
Symmetric algorithms, on the other hand, use a single private key to encode and decode data [5].They can handle large data in terms of computation.Plaintexts are encrypted using symmetric algorithms as a block of fixed digits [1].The Advance Encryption Standard (AES) cipher text method is a more accurate and elegant cryptographic method.
According to testing results and the text files used, it has been concluded that the AES algorithm outperforms the Data Encryption Standard (DES) and RSA algorithms [6,7].

Advance Encryption Standard (AES)
The AES, known as the Advanced Encryption Standard algorithm, was made and implemented by Joan Daemen and Vincent Rijmen in 2001 [8].It has a specific block size of 16 bytes (128 bit), variant key sizes of 16 (128), 24 (192) and 32 bytes [7,8] (256 bit), and transformation rounds on a block that are specified using key sizes fixed by numbers.There are 10 rounds for the 16-byte-sized key, 12 rounds for the 24-byte-sized key, and 14 rounds for the 32-byte-sized key. Figure 2 shows a diagrammatic explanation of the AES algorithm [7,8].Encryption begins and ends by adding a round key and then applying rounds n times, where the final round is different.For decryption, the inverse process is followed.

C. Mixed Columns
Transformation occurs on every column of four bytes using a specific mathematical function.Four completely new and different bytes are produced, which take the place of the originals.This results in another matrix consisting of 16 new bytes.It is not to be executed in the final round.
D. Addroundkey: XOR gate is applied to the 16 bytes of the matrix to make 128 bits of the round key.If this process is the last round then cipher text is the final outcome.Otherwise, the resulting 128 bits are then analyzed as 16 bytes and one more similar process begins.
AES is faster in comparison with other algorithms; 2.
Due to its extra fast speed, it becomes extremely difficult to hack or access the data. Drawbacks: 1.
A high amount of excessive and complex algebra is being used; 2.
The deployment and implementation of its software carries some difficulties.

RSA Algorithm
RSA is the most popular asymmetric or public key cryptography that works on the concept of dual keys [9].The public key of the sender is utilized for encrypting the text whereas a secret key is utilized for decryption.This is an adaptable and universally used algorithm that depends upon prime factorization and considers large prime numbers for security.It is used for open networks, e-commerce security, virtual private networks, emails, and handling the authenticity of e-documents [10].

Key Generation Process of RSA Algorithm
The algorithm generates two different keys: one is used for encryption and other is used in decryption.The following is the procedure to create the keys: 1.
Assign two random large prime numbers, m and n, and calculate p = m * n; 2.
Compute the golden ratio of p,

AES Merits and De-Merits
Advantages: 1. AES is faster in comparison with other algorithms; 2. Due to its extra fast speed, it becomes extremely difficult to hac Drawbacks: 1.A high amount of excessive and complex algebra is being used 2. The deployment and implementation of its software carries som

RSA Algorithm
RSA is the most popular asymmetric or public key cryptograp concept of dual keys [9].The public key of the sender is utilized fo whereas a secret key is utilized for decryption.This is an adaptable algorithm that depends upon prime factorization and considers larg security.It is used for open networks, e-commerce security, virtu emails, and handling the authenticity of e-documents [10].

Key Generation Process of RSA Algorithm
The algorithm generates two different keys: one is used for en used in decryption.The following is the procedure to create the key 1.Assign two random large prime numbers, m and n, and calcula 2.
3. Compute the golden ratio of p, 4.

7.
Choose integer e such that the greatest common divisor of (ȹ (p (n); 8. Compute d = e −1 mod (ϕ (n)); 9.The public key is found from (e, p) and the private key is found This creates cipher text by applying the public key on plaintex C = pe mod p.
This finds plaintext by applying the private key on the cipher te P = Cd mod p.

Rsa Merits and De-Merits
Advantages: 1.It provides a safe, secure and protected transfer of data; 2. It makes it difficult for hackers/crackers to crack the file.

Disadvantage:
1. Time required by RSA is greater and makes the process slow used.

Time Complexity Analysis
Asymptotic time complexity of RSA algorithms is concluded to use of the private key while O({logn} 2 ) is observed for the use of th based on a specific block size, so it is O(m) complexity, where m rep entered message [4].Comparing the two time complexities, it can b a longer time to encrypt and decrypt data.

Experimental Analysis
Choose integer e such that the greatest common divisor of (

AES Merits and De-Merits
Advantages: 1. AES is faster in comparison with ot 2. Due to its extra fast speed, it becom Drawbacks: 1.A high amount of excessive and com 2. The deployment and implementatio

RSA Algorithm
RSA is the most popular asymmetr concept of dual keys [9].The public key whereas a secret key is utilized for decry algorithm that depends upon prime fact security.It is used for open networks, emails, and handling the authenticity of

Key Generation Process of RSA Alg
The algorithm generates two differ used in decryption.The following is the 1.Assign two random large prime nu 2. 3. Compute the golden ratio of p, 4.
This finds plaintext by applying the P = Cd mod p.

Rsa Merits and De-Merits
Advantages: 1.It provides a safe, secure and protec 2. It makes it difficult for hackers/crac Disadvantage: 1. Time required by RSA is greater a used.

Time Complexity Analysis
Asymptotic time complexity of RSA use of the private key while O({logn} 2 ) i based on a specific block size, so it is O(m entered message [4].Comparing the two a longer time to encrypt and decrypt dat
The public key is found from (e, p) and the private key is found from (d, p); This creates cipher text by applying the public key on plaintext P at the sender side.C = pe mod p.
This finds plaintext by applying the private key on the cipher text at the receiver side.P = Cd mod p.
It provides a safe, secure and protected transfer of data; 2.
It makes it difficult for hackers/crackers to crack the file. Disadvantage: 1. Time required by RSA is greater and makes the process slow when large data are used.

Time Complexity Analysis
Asymptotic time complexity of RSA algorithms is concluded to be O({logn} 3 ) for the use of the private key while O({logn} 2 ) is observed for the use of the public key.AES is based on a specific block size, so it is O(m) complexity, where m represents the size of the entered message [4].Comparing the two time complexities, it can be seen that RSA takes a longer time to encrypt and decrypt data.

Experimental Analysis
For a better comparison of the RSA and AES algorithms, Windows Azure SDK was required to form the application.By running the application over the cloud, which is a third-party host, values were recorded during the encryption and decryption of messages and the time taken with different key sizes in bits and kilobits for RSA and AES was measure [11].Figure 3 shows the time taken by the RSA algorithm against the number of bits while Figure 4 shows the time taken by the AES algorithm against kilobits.Comparing the two graphs of RSA and AES, it can be seen that the AES algorithm takes much less time compared to RSA. bits while Figure 4 shows the time taken by the AES algorithm against kilobits.Comparing the two graphs of RSA and AES, it can be seen that the AES algorithm takes much less time compared to RSA.Table 1 shows the limitations, parameters and constraints of the AES and RSA algorithms [9,12].The resources and power consumption of AES are comparatively lower than that of the RSA algorithm while AES is faster than RSA [13].

Conclusions
Encryption of the most secure and least time-consuming algorithms is a major need today.The AES algorithm is the method of lesser time complexity and due to its flexible and scalable behavior it is easily implemented, leaving the RSA algorithm behind in terms of memory requirements.The AES algorithm protects data with its high security level and can counterattack against a variety of attacks.Unlike RSA, the AES algorithm requires less storage space while providing a higher performance without any major limitations.However, with fast-paced technology, hybrid models are taking over ordinary security algorithms.Thus, a hybrid model of AES and RSA will increase the security of the cloud overall.
× 4 matrix is moved to the left side.Items are reinserted on the right of the row if they 'fall off'.Movement is carried out as follows: • Finally, a new matrix is generated with a similar 16 bytes but they move with respect to each other.

Table 1 .
Comparison of AES and RSA algorithms.