1.1. Research Background
Cloud computing is a general term for anything that involves delivering hosted services over the Internet  . These services are broadly divided into three categories: Infrastructure-as-a-Service (IaaS), Platform-as-a-Service (PaaS) and Software-as-a-Service (SaaS). There are total three principles of cloud computing and they are, on demand computing resources, founding a pay-as-you-go business model for computing and information technology services that can be used for elastic scaling, and elimination of up-front capital and operational expenses  .
As the rate of cybercrimes increasing rapidly throughout the internet, and cloud computing is an enchanting target for many reasons that’s why data security plays the most key role in the cloud and the major concern over the internet in order to serve all the services and benefits of it. Data secrecy over the network could be achieved by using cryptographic technique that is the process of encryption and decryption.
Encryption is the method by which plaintext is converted from a readable form to an encoded version (cipher text) that can only be decoded by another entity if they have access to a decryption key. Decryption is the reverse process encryption to convert the encrypted text into plain text. There are three most common types of encryption and decryption methods and they are Symmetric, asymmetric, and hybrid algorithms that can be used to encrypt and decrypt data in cloud computing storage  .
Symmetric encryption is an encryption system in which the sender and receiver of a message share a single common key that is used to encrypt and decrypt the message. Symmetric algorithm that is used in cloud computing are Data Encryption Standard (DES), Advanced Encryption Standard (AES). Asymmetric Encryption uses two distinct yet related keys, one key is a Public key which is used for encryption and the other key is the Private key used for decryption. The private key is intended to be private so that only the authenticated recipient can decrypt the message. An example of asymmetric algorithm used in cloud computing is RSA algorithm. Hybrid encryption is a method of encryption that combines two or more encryption schemes and includes a combination of symmetric and asymmetric encryption to take advantage of the strengths of each type of encryption  .
It’s a research where authors are developing novel a symmetric algorithm which will be used for the encryption and decryption of data stored in the cloud thus enhancing the data security of the cloud. In this paper, authors used several permutation to increase the complexity and security.
The reason behind choosing symmetric encryption is that symmetric key encryption doesn’t require as many CPU cycle as asymmetric key encryption, so it can be said that it’s generally faster. Thus, when it comes to speed, symmetric is much faster than asymmetric.
For encrypting private and sensitive data or information symmetric encryption trumps the asymmetric encryption, as symmetric encryption uses the same key for both encryption and decryption. So unless the sender himself tells the secret key to the receiver, the receiver will never be able to decrypt the message.
To design and develop a symmetric algorithm for enhancing data security in cloud.
1.3. Justification of Study
Cloud computing is perhaps the most flamboyant technological innovation of the 21st century. Because Cloud computing facilitates the access of applications and data from any location worldwide and from any device with an internet connection. But the security of client’s data is a major responsibility of a cloud provider. To be secured information needs to hidden from unauthorized access (Confidentiality), protected from unauthorized change (integrity), and available to the authorized entity when it is needed (availability). And it not uncommon that many cloud servers have been under attack by hackers and lost valuable data for the lack of security.
As the world progresses people are becoming more and more dependent on these sort of services to store their data and information and it has become utmost important to protect the data that are stored in the cloud. Our algorithm mainly works to improve the security and overcome these problems.
The most important services that our algorithm will provide are:
*Confidentiality: The algorithm aims to unauthorized disclosure of the protected data.
*Integrity: Protect against illegal modification and deletion.
*Authorization: Algorithm will prevent the access of unauthorized users.
By providing these services, algorithm ensures more security in cloud computing.
1.4. Scope of Study
Data security is one of the biggest challenges at the current time. The security of client’s data is major responsibility of cloud provider. Cloud computing is likely to suffer from a number of known and unknown vulnerabilities, enabling attackers to either obtain computing services for free or steal information from cloud. To solve this problem, we have proposed a symmetric algorithm that will provide safest data security and will prevent the unauthorized access of dada. It will provide data to the authorized user without any loss of data or theft of data.
1.5. Contribution of the Proposed Work
The main contribution of the proposed work in terms of encrypting data of the cloud is that the algorithm can encrypt up to 192 bits of data at a time. So in cases of encrypting a large amount of data the algorithm works efficiently saving more time. Each of the rounds and the algorithm itself has been designed in such a way that it is impossible to crack or decipher the encrypted texts without the key. Each round of encryption and decryption process has several customize permutation which makes the algorithm more secure from theft. By using a secure encryption and decryption process and a large key size of 192 bits and a secure SHA-512 as hash function, the proposed algorithm achieves the cryptographic goals which are confidentiality, integrity and authentication. So it provides robust security to the data stored in cloud for which it has been designed for.
1.6. Brief Introduction of the Paper
In the literature review chapter, the authors have reviewed the existing related works that have been done by other authors and also showed the key difference. In the methodology section, the authors have written about the method of the proposed work. In the research design and analysis section the authors talk about the SHA-512 for message authentication, encryption and decryption process, the flowchart of encryption and decryption and has theoretically proven the algorithm. There is also a security analysis of the algorithm and the implementation of the algorithm which is done in Java is showed. The author also showed a model to use the algorithm in cloud. The next section is the result discussion, where the authors compare the proposed algorithm with existing algorithm. The next section is the conclusion.
2. Literature Review
Cloud Computing is transforming information technology. As information and processes are migrating to the cloud, it is transforming not only where computing is done, but also fundamentally, how it is done. As increasingly more corporate and academic worlds invest in this technology, it will also drastically change IT professionals’ working environment. Cloud Computing solves many problems of conventional computing, including handling peak loads, installing software updates, and, using excess computing cycles.
Cloud computing has significantly impacted every section of our lives and business structure. Securing the cloud data is the major concern in the cloud computing environment. Many research works are being proposed to secure cloud data.
In  , the author proposed a hybrid cryptography model for cloud data security which combines the symmetric key (AES) and asymmetric key (Hyper Elliptic Curve Cryptography (HECC)) techniques. The AES and HECC algorithms are used for the key generation, encryption and decryption processes. To enhance the level of data security in cloud she used Hyper Elliptic Curve Cryptography (HECC). The HECC in cloud environment typically have encrypted with the public key and decrypted with a private key. The reviewed paper works with block size of 128 bit whereas the proposed work provides the facility to take 192 bits as block size.
In  , the authors have developed a hybrid hashing security algorithm for data storage on cloud computing which makes the data more secure from theft. In this work, they used hybrid algorithm (RSA and AES) and hash functions for securing cloud data storage. In this work, they proposed a new Hybrid-SHA256 algorithm. They used different data input sizes (34, 67, and 93) kb, for both the Hybrid and Hybrid-SHA256 algorithms. Their model provides more secure encryption than Hybrid model because the model used hashing and digital signature concept. The reviewed work used hybrid algorithm (RSA and AES) whereas our algorithm is totally new. The reviewed work used SHA-256 and digital signature concept, on the other hand, the proposed algorithm used SHA-512 for message authentication.
In  , the authors proposed a model to secure user data in cloud computing using encryption algorithms in which they used different algorithms. They proposed several different algorithms to eliminate the concerns regarding data loss, segregation and privacy. They used RSA, DES, AES and Blowfish algorithm to encrypt and decrypt data in cloud and compare the accuracy of each algorithm. They use different key size for each algorithm. The key length of DES algorithm is 56 bits. The key size of AES algorithm is 128, 192 and 256 bits. The key size of Blow-fish algorithm is 128 - 448 bits. The key size of RSA algorithm is 1024 bits. They found that AES algorithm takes the least time to execute cloud data. Blowfish algorithm has the least memory requirement. DES algorithm takes least encryption time. RSA takes longest memory size and encryption time. The reviewed work did a survey on four different algorithms by comparing them considering their advantages and disadvantages, on the other hand, the proposed algorithm specifically works for encrypting data in cloud in a secure way.
In  , the authors developed an encryption algorithm to enhance data security in cloud storage. Their algorithms suggest the encryption of the files to be uploaded on the cloud. The security of the data uploaded by the user is ensured by doubly. The algorithm encrypts the data as well provides access to the data only on successful authentication. In this algorithm, the uploaded file will be encrypted by using AES algorithm. The AES key is encrypted by RSA Algorithm. The reviewed algorithm works for encrypting file and store it in cloud but the proposed work encrypt text and store it in cloud.
In  , the authors have developed an algorithm to enhance data security in cloud computing. They developed a Lightweight cryptographic algorithm. The algorithm mainly works in three steps. Firstly, key exchange. This step has two parts: key generation and key exchange. Secondly, Data storage in which the encrypted data is stored in cloud. Thirdly, data access by which the user requests the data from the cloud storage. To do this the authors used asymmetric and symmetric cryptographic algorithm. The data is encrypted by a symmetric algorithm and then the symmetric key distribution between cloud provider and the user is done by using an asymmetric algorithm. The reviewed paper used a Light weight cryptographic algorithm which works in three steps where the proposed algorithm is a customized symmetric algorithm.
In  , the authors proposed an encryption technique for the information security in cloud computing which can prevent the attacks on the data. The algorithm consists of three layers. Firstly-Authentication layer, Secondly-Encryption and confidentiality, thirdly-Data store. Authentication layer provides authentication by constructing a secret key from the user password and by digital signature. Encryption and confidentiality layer encrypt the user data by using AES. Then the Data store layer stores the user data. The reviewed paper uses AES for encryption whereas the proposed algorithm is a new customize concept of symmetric encryption.
In  , the authors have developed a model to prevent the threats in cloud. They build a model to share data in cloud using RSA and for data integrity used MD5 algorithm. The difference between the reviewed work and the proposed work is that they used RSA for encryption and MD-5 for integrity, on the contrary, a new symmetric algorithm and SHA-512 is used for encryption and integrity in this proposed work.
In  , the authors proposed a simple data protection model where data is encrypted using Advanced Encryption Standard (AES) before it is launched in the cloud, thus ensuring data confidentiality and security, a privacy-preserving public auditing system for data storage security in cloud computing is intended, although the computational time is increased but the privacy is preserved where data is stored in the cloud by using the most prominent algorithm AES. The difference between the reviewed work and the proposed work is that the reviewed work used a data protection model before storing data in cloud which takes more time than the proposed algorithm.
In  , the authors proposed a model where they provide architecture and guidelines to increase the security as well as the privacy of the data owner by transferring the process of encryption and decryption from the cloud to self. For maximizing the security of data, user segments and encrypts the data using a secured co-processor. This work provides guideline and architecture to increase security using a secured co-processor and the proposed work uses a symmetric algorithm to secure the cloud data.
In  , the authors proposed a model for a privacy-preserving public auditing system for data storage security in cloud computing is intended, although the computational time is increased but the privacy is preserved where data is stored in the cloud by using the most prominent algorithm AES. The reviewed work is based on a model for privacy-preserving public system where the privacy is presented using AES algorithm. The proposed work uses a totally new symmetric encryption for encrypting and decrypting cloud data.
In  , the authors proposed a model for data security in cloud computing using AES under Heroku cloud. The implementation for deploying Heroku as a cloud platform consists of several steps. Then, they implement a website as an application to data security. In the website, they implement AES as data security algorithm. The performance evaluation shows that AES cryptography can be used for data security. Moreover, delay calculation of data encryption shows that larger size of data increases the data delay time for encrypting data. The reviewed algorithm used AES algorithm under Heroku cloud whereas the proposed algorithm is not specified for any cloud platform.
In  , the authors proposed a system to achieve secure data sharing for dynamic groups in the cloud, they expect to combine the group signature and dynamic broadcast encryption techniques. Specially, the group signature scheme enables users to anonymously use the cloud resources, and the dynamic broadcast encryption technique allows data owners to securely share their data files with others including new joining users. Unfortunately, each user had to compute revocation parameters to protect the confidentiality from the revoked users in the dynamic broadcast encryption scheme, which results in that both the computation overhead of the encryption and the size of the cipher text increase with the number of revoked users. The reviewed work is a system for securely sharing data in dynamic group of cloud. The proposed algorithm is for securely storing data in cloud.
In  , the author proposed ploud architecture is enhanced security model for data storage within cloud environment. It consists of various users with local availability of mail server and cryptographic application. A cryptographic application installed on client side will connect user with storage and allows for encryption and decryption operation on data. As the cryptographic application is installed on client’s machine it will increase speed-up ratio and mean processing for encryption and decryption process. The authentication server used for authenticating users to enter into server environment and use available functionalities. The reviewed work allows a limited number of user having a local availability of email server and cryptographic application to store data in cloud where the proposed algorithm has no limitation on user to store data in cloud.
In  , the authors proposed that cloud customers may form their expectations based on their past experiences and organizations needs. They are likely to conduct some sort of survey before choosing a cloud service provider. Customers are expected also to do security checks that are centered on three security concepts: confidentiality, integrity and availability. Access controls to ensure that only authorized users gain access to applications, data and the processing environment and is the primary means of securing cloud-based services. Service providers are able to inspect activity in their environment and provide reports to clients. Ya-Qin Zang proposed that Computing. The reviewed work provides security to cloud according to customers expectation based on their experience. On the contrary, the proposed algorithm is developed based on all the risk factors and threats on cloud data.
In  , the authors proposed cloud security data model which based on a three-layer system structure, in which each layer performs its own duty to ensure the data security of cloud layers. The first layer is responsible for cloud user authentication. It is designed as OTP authentication module and uses digital certificates issued by the appropriate users and also manage user permissions. The second layer manages the user’s data encryption by using AES algorithm, which is the most secured and faster encryption algorithm. For sensitive data such as one’s personal information (ex. credit card number) should be encrypted and sent to the cloud. Data integrity is provided by using algorithms like MD5 and RSA. For non-sensitive data such as one’s local information (ex. address details), it should be protected by using digital signatures and sent to the cloud. It also protects the privacy of users based on fine-grained attribute-based access control policies through access control policy algorithms. Access control mechanisms are tools to ensure authorized user can access and to prevent unauthorized access to information systems. Such mechanisms should cover all stages in the lifecycle of user access, from the initial registration of new users to the final de-registration of users who no longer require access to information systems and services. Special attention should be given, where appropriate, to the need to control the allocation of privileged access rights, which allow users to override system controls. The third layer supports the faster user data recovery by using Byzantine fault tolerance algorithm methods. The reviewed work is a three layer-based cloud security data model. The proposed algorithm is a data encryption algorithm for enhancing data security in cloud.
In  , the authors proposed a model to protect the data from attackers by using two essential processes. These processes are listed as Encryption and Decryption. Encryption is the process of converting the data to stop it from attackers to read the original data clearly. Encryption involves conversion of plain text to unreadable format. It is known as cipher text. The user cannot read the above format. Hence, the next process that is carried out by the user is Decryption. In the world of computing, there exist security issues for storing the data in cloud. In order to secure data in cloud AES encryption technique is used in this project. Advanced Encryption Standard is a block cipher with a block length of 128 bits. It permits three different key lengths: 256, 192,128 or bits. The reviewed work uses AES algorithm for encrypting and decrypting data. The proposed algorithm uses a new symmetric algorithm that is more secure and less time consuming than AES.
The main difference between the proposed work and the existing related works that have been reviewed this section are that most of these papers work with block size of maximum 128 bits. Whereas, the proposed algorithm works with 192 bits. The key size of the proposed algorithm is also 192 bits where the maximum reviewed papers work with key size of 128 bits.
In this research paper, authors used 5 phases to describe the procedure. These phases are planning, requirement analysis, proposed algorithm, implementation, testing and result. Figure 1 shows the method of the proposed work.
A successful research begins with a proper planning. So the authors started this process of research with a proper plan. The plan includes the topic of the research and the working process. First of all, the authors went through many research works of similar topic. Then the authors selected the title based on the knowledge gained from those papers. While going through those papers the authors found out that there were few limitations in every work. So the authors planned the research to overcome those limitations, also keeping a uniqueness to the work.
Figure 1. Proposed methodology.
3.2. Requirement Analysis
Every work has some requirements according to needs. The proposed work does require some specific resources.
1) System Requirements: system requirement can be isolated into two types:
a) Software requirement.
b) Hardware requirement.
• Software Requirements
ii) Environment—JDK and JRE.
iii) Operating System—Windows, Linux, MAC.
iv) Cloud Server.
v) External Algorithm—AES, DES, SHA.
• Hardware Requirements
i) Laptop or Desktop with processor.
ii) USB cable.
2) User Requirements: user requirement includes what the user expects from the system. For this, the user wants the security of data including integrity, confidentiality and authentication.
3.3. Proposed Algorithm
The proposed algorithm works in Block wise. The proposed algorithm takes a plain text of up to 192 bits block of data and converts it into a cipher text. This algorithm includes many specific methods for encryption and decryption. For both the encryption and decryption, the key size is same which is 192 bits. The algorithm encrypts and decrypts the data in 12 rounds. Each round uses the same key to encrypt and decrypt the data. A hash value is also generated for authentication. The goal of the proposed algorithm is to secure and enhance the protection of data stored in cloud.
The programming language used to design the proposed algorithm is java. In java, for encrypting data, the algorithm works in two steps. At first, it takes input, secondly it requires a 192-bit secret key to encrypt, after providing key, the algorithm encrypts the data and gives a cipher text as output and a hash code is also generated. For decrypting data, the algorithm works in three steps, at first, it receives the cipher text, secondly it requires the same secret key and thirdly it receives the hash code and then it decrypts the data and provides the original text. After implementing the algorithm in java, the authors propose to use the algorithm in cloud.
3.5. Testing and Result
After implementation, the authors got the result that satisfies the conditions. After that, they compared it with other similar existing algorithm and found that the algorithm fulfills all the conditions of enhancing security of the cloud in a better way than the other existing algorithm.
4. Research Design and Analysis
In Figure 2, the authors showed the overview of Encryption and Decryption Process:
Figure 2. Flowchart of encryption and decryption process overview.
4.1.1. SHA 512 Logic
SHA 512 is a cryptographic hashing algorithm that input as a message with a maximum length of less than 2128 and provides output as a 512-bit massage digest. The algorithm process the input in 1024 bits blocks. Figure shows the overall processing of a message to produce a digest  .
4.1.2. Features of SHA-512 Hashing Algorithm
• Plaintext Block Size = 1024 bits.
• No. of Rounds/steps = 80.
• Each Round-Qword = 64 bits.
• Each Round-constant K Buffer—8 buffers (a, b, c, d, e, f, g, h).
• Store Intermediate result.
• Each buffer size—64 bits.
4.1.3. Message Digest Generation Using SHA-512-
Step 1: Append padding bits—pad the bits 100… so that length of plain text is 128 < multiple of 1024 bits.
Step 2: Append length—append 128-bit representation of original plain text such that length = Multiple of 1024 bits.
Step 3: Initialize hash buffer—initialize the buffers (a, b, c, d, e, f, g, h) in 64 bit in Hexadecimal.
Step 4: Process each block of plain text in 80 rounds.
Step 5: Output—hash code of 512 bits.
Figure 3. Message digest generation using SHA-512 (“message digest generation using SHA 512-Google search”)  .
Figure 4. Processing of a single 1024-bit block in SHA-512 (“processing of a Single 1024-bit block in SHA 512-Google search”)  .
4.2. Encryption Process
4.2.1. Encryption Process Flow Chart
Figure 5 shows the encryption process flowchart.
4.2.2. Block Diagram of Encryption Process Round Function
In Figure 6, the authors showed the round function of encryption process.
4.2.3. Encryption Process Description
1) Take an input or plaintext message of any size and key text of 24 bytes.
2) Generate 4 * 6 block matrix, which is denoted by M, Initially i = 0, j = 0, which is shown in Table 1.
3) Convert the messages characters into ASCII equivalent.
4) Perform Shift Rows using following steps:
*Row 1 (R1)—3 bit Left circular shift.
*Row 2 (R2)—2 bit Left circular shift.
*Row 3 (R3)—1 bit Left circular shift.
*Row 4 (R4)—0 bit Left circular shift.
5) Enact Permutation 1 using following steps:
Step i: Interchange column-C1 by C2 and C2 by C1.
Step ii: Interchange column-C3 by C4 and C4 by C3.
Step iii: Interchange column-C5 by C6 and C6 by C5.
Step iv: Interchange Row-R1 by R3 and R3 by R1.
Step v: Interchange Row-R2 by R4 and R4 by R2.
6) Reverse the whole block of matrix.
Figure 5. Encryption process flowchart.
Table 1. Generation of 4 * 6 matrix.
7) Enact Permutation 2 using following steps:
Step i: Interchange column-C5 by C6 and C6 by C5.
Step ii: Interchange Row-R1 by R4 and R4 by R1.
Step iii: XOR between column C1 and column C3 i.e. C1 ♁ C3 = X.
Step iv: XOR between column C2 and column C4 i.e. C2 ♁ C4 = Y.
Figure 6. Round function of encryption process.
Step v: Replace C1 by X and C2 by Y.
8) Convert the values into equivalent Hexadecimal value.
9) Apply Substitution Box (S-box).
10) Convert the values into ASCII equivalent.
11) Perform mix column operation that is to XOR the constant matrix with the result of step 10. Table 2 shows the predefined constant matrix.
12) Calculate the key using the following steps:
* Generate 4 * 6 block matrix from key text which contains fixed-length size of 24 bytes or (192 bits) each.
* Convert the key characters into ASCII equivalent.
13) Perform XOR between the resultant mix column and the calculated key matrix.
14) Arrange the matrix values as plain text.
15) Convert the plain text into corresponding encoding characters using base 64 encoders  .
• AES SubBytes transformation Table.
Table 3 provides value of Rijndeal S-box  .
Table 2. Constant matrix.
Table 3. AES SubBytes transformation (“Rijndeal S-box”, 2019)  .
4.2.4. Theoretical Proof of Encryption Process
The proposed algorithm encrypts the data in 12 rounds. For theoretical proof, the authors showed the calculation of just one round.
Insert a plaintext.
→ Anwar Newaz Feroz from 34c.
Arrange the plain text in 4 * 6 matrix (see Table 4).
Convert into equivalent ASCII value (see Table 5).
Perform Shift Rows (see Table 6).
Enact Permutation 1:
Interchange column-C1 by C2 and C2 by C1 (see Table 7).
Interchange column-C3 by C4 and C4 by C3 (see Table 8).
Interchange column-C5 by C6 and C6 by C5 (see Table 9).
Interchange Row-R1 by R3 and R3 by R1 (see Table 10).
Interchange Row-R2 by R4 and R4 by R2 (see Table 11).
After Permutation 1 the result is (see Table 12).
Reverse the whole block of matrix (see Table 13).
Table 4. 4*6 matrix of plaintext.
Table 5. ASCII conversion.
Table 6. Shift Row operation.
Table 7. Interchange column.
Table 8. Interchange column.
Table 9. Interchange column.
Table 10. Interchange row.
Table 11. Interchange row.
Table 12. Result of permutation 1.
Table 13. Reverse the whole block.
Interchange column-C5 by C6 and C6 by C5 (see Table 14).
Interchange Row-R1 by R4 and R4 by R1 (see Table 15).
Perform C1 ♁ C3 = X (see Table 16).
Perform C2 ♁ C4 = Y (see Table 17).
Replace C1 by X and C2 by Y (see Table 18).
After Permutation-2 the result is (see Table 19).
Convert into equivalent Hexadecimal Value (see Table 20).
Replace the value using S-Box (see Table 21).
Convert into equivalent Decimal Value (see Table 22).
Mix column operation (see Table 23).
Tables 24-29 show the XOR operation between each column of Mix column operation.
Resultant mix column (see Table 30).
Table 14. Interchange column.
Table 15. Interchange row.
Table 16. C1 ♁ C3.
Table 17. C2 ♁ C4.
Table 18. Value exchange.
Table 19. Result of permutation 2.
Table 20. Hexadecimal conversion.
Table 21. Value replacement using S-box.
Table 22. Decimal conversion.
Table 23. Mix column.
Table 24. XOR operation.
Table 25. XOR operation.
Table 26. XOR operation.
Table 27. XOR operation.
Table 28. XOR operation.
Table 29. XOR operation.
Table 30. Result of Mix column operation.
→ This key is symmetric.
Arrange this plaintext in a 4 * 6 matrix table (see Table 31).
Convert into equivalent ASCII value (see Table 32).
Back to Encryption
XOR between the last resultant mix column table and the key text table (see Table 33).
Tables 34-39 show the XOR between the last resultant mix column table and the key text table.
Resultant matrix is (see Table 40).
Arrange in plain text:
86 145 223 65 248 192 211 126 12 235 50 205 33 218 172 118 88 221 87 161 56 97 233 222.
Convert into Cipher text:
Table 31. 4*6 matrix of key text.
Table 32. ASCII conversion.
Table 33. XOR between resultant mix column and key text table.
Table 34. XOR operation.
Table 35. XOR operation.
Table 36. XOR operation.
Table 37. XOR operation.
Table 38. XOR operation.
Table 39. XOR operation.
Table 40. Resultant matrix.
4.3. Decryption Process
4.3.1. Decryption Process Flow Chart
Figure 7 shows the decryption process flowchart.
4.3.2. Block Diagram of Decryption Process Round Function
In Figure 8, the authors showed the round function of decryption process.
4.3.3. Decryption Process Description
1) Received the cipher text from the encryption process.
2) Decode the cipher text using base 64 decoders  .
3) Generate 4 * 6 block matrix of the decoded value, which is denoted by Md. Initially I = 0, j = 0, which is shown in Table 41.
4) Calculate the key using following steps:
*Generate 4 * 6 block matrix from key text which contains fixed-length size of 24 bytes or (192 bits) each.
*Convert the key characters into ASCII equivalent.
5) Perform XOR between the result generated block matrix Md and the calculated key matrix.
6) Perform mix column operation that is to XOR the constant matrix with the result of step 5.
Table 42 shows the predefined constant matrix:
7) Convert the matrix values into equivalent Hexadecimal.
8) Apply Reverse Substitution Box (S-Box).
9) Convert the Hexadecimal values into Decimal value.
10) Enact Permutation 4 using following steps:
Step i: XOR between column C1 and column C3 i.e. C1 ♁ C3 = X.
Figure 7. Decryption process flowchart.
Table 41. Generation of 4 * 6 matrix.
Table 42. Constant matrix.
Figure 8. Round function of decryption process.
Step ii: XOR between column C2 and column C4 i.e. C2 ♁ C4 = Y.
Step iii: Replace C1 by X and C2 by Y.
Step iv: Interchange Row-R1 by R4 and R4 by R1.
Step v: Interchange column-C5 by C6 and C6 by C5.
11) Reverse the whole block of matrix.
12) Enact Permutation 3 using the following steps:
Step i: Interchange Row-R2 by R4 and R4 by R2.
Step ii: Interchange Row-R1 by R3 and R3 by R1.
Step iii: Interchange column-C5 by C6 and C6 by C5.
Step iv: Interchange column-C3 by C4 and C4 by C3.
Step v: Interchange column-C1 by C2 and C2 by C1.
13) Perform inverse Shift Rows.
14) Convert the decimal values into equivalent ASCII character.
15) Finally Arrange the ASCII equivalent into plaintext.
• AES inverse SubBytes transformation table.
Table 43 provides the value of Rijndeal inverse S-box  .
Table 43. AES Inverse SubBytes transformation (“Rijndeal S-box”, 2019)  .
4.3.4. Theoretical Proof of Decryption Process
The proposed algorithm decrypts the data in 12 rounds. For theoretical proof, the authors showed the calculation of just one round.
86 145 223 65 248 192 211 126 12 235 50 205 33 218 172 118 88 221 87 161 56 97 233 222
Arrange the cipher text into 4 * 6 matrix table (see Table 44).
→ This key is symmetric.
Arrange this plaintext in a 4 * 6 matrix table (see Table 45).
Convert into equivalent ASCII value (see Table 46).
Back to Decryption
XOR between the arranged cipher text matrix table and the key text table (see Table 47).
Tables 48-53 show the XOR between the arranged cipher text matrix table and the key text table.
Resultant matrix is (see Table 54).
Table 44. 4 * 6 matrix of decoded value.
Table 45. 4 * 6 matrix of key text.
Table 46. ASCII conversion.
Table 47. XOR between arranged cipher text and key text table.
Table 48. XOR operation.
Table 49. XOR operation.
Table 50. XOR operation.
Table 51. XOR operation.
Table 52. XOR operation.
Table 53. XOR operation.
Table 54. Resultant matrix.
Mix column operation (see Table 55).
Tables 56-61 show the XOR operation between each column of Mix column operation.
Resultant mix column (see Table 62).
Convert into equivalent Hexadecimal Value (see Table 63).
Replace the value using Reverse S-Box (see Table 64).
Convert into equivalent Decimal Value (see Table 65).
Perform C1 ♁ C3 = X (see Table 66).
Perform C2 ♁ C4 = Y (see Table 67).
Replace C1 by X and C2 by Y (see Table 68).
Interchange Row-R1 by R4 and R4 by R1 (see Table 69).
Interchange column-C5 by C6 and C6 by C5 (see Table 70).
After Permutation 4 the result is (see Table 71).
Reverse the whole block of matrix (see Table 72).
Enact Permutation 3:
Interchange Row-R2 by R4 and R4 by R2 (see Table 73).
Table 55. Mix column.
Table 56. XOR operation.
Table 57. XOR operation.
Table 58. XOR operation.
Table 59. XOR operation.
Table 60. XOR operation.
Table 61. XOR operation.
Table 62. Result of mix column operation.
Table 63. Hexadecimal conversion.
Table 64. Value replacement using reverse s-box.
Table 65. Decimal conversion.
Table 66. C1 ♁ C3.
Table 67. C2 ♁ C4.
Table 68. Value exchange.
Table 69. Interchange row.
Table 70. Interchange column.
Table 71. Result of permutation 4.
Table 72. Reverse the whole block.
Table 73. Interchange row.
Interchange Row-R1 by R3 and R3 by R1 (see Table 74).
Interchange column-C5 by C6 and C6 by C5 (see Table 75).
Interchange column-C3 by C4 and C4 by C3 (see Table 76).
Interchange column-C1 by C2 and C2 by C1 (see Table 77).
After Permutation-3 the result is (see Table 78).
Perform inverse shift rows (see Table 79).
Convert into equivalent ASCII value (see Table 80).
Arrange in Plain text/Decrypted text:
Anwar Newaz Feroz from 34c.
Table 74. Interchange row.
Table 75. Interchange column.
Table 76. Interchange column.
Table 77. Interchange column.
Table 78. Result of Permutation 3.
Table 79. Inverse shift row operation.
Table 80. ASCII conversion.
4.4. Security Analysis
Cloud is being used for storing sensitive and important data so it is very important to use a strong key that will provide security to the data stored in cloud. If we used a key of 10 characters using alphanumeric character. There are total 26 alphabets in English and if we count the upper and lower cases the total numbers are 26 + 26 = 52 and if we count the numeric digits the total number is 62. For a 10 character key, it will be 6210 or 8.39 * 1017 or 8.4 quintillion combination almost. A computer would take almost 257,201,646.091 years to crack a 10 digits key. A super computer will take 800,000,000 seconds or 133,333,333.333 minutes or 2,222,222.22222 hours or simply we can say it will take almost 257 years to crack the key. This calculation is for 10 digits key and if we take 48 digits key also count the special characters then it will take a numerous amount of time to crack the key which sounds almost impossible.
4.5. Implementation of the Algorithm in Java
Figure 9 shows the Starting of the program:
When a user wants to encrypt a text, he had to type his text in “Input: (Text/ Encrypted Text)” panel. Then he had to give a secret key of 192 bits in “Key:” panel. Then he had to click on “Encrypt” button (see Figure 10).
After clicking on “Encrypt” button the encryption will be done and user will get a “Cipher text” as output in “Output: (Text/Encrypted Text)” panel and a “Hash code” is also generated in “Hash:” panel (see Figure 11).
To get the plain text from the cipher text, user had to copy the cipher text from “Output: (Text/Encrypted Text)” and paste it in “Input: (Text/Encrypted Text)” panel and copy and paste the “Hash code” in “Hash:” panel.
After that he had to enter the same secret key in “Key:” panel and then he had to click on “Decrypt” button (see Figure 12).
After clicking on “Decrypt” button, the decryption process will be done and user will get the original text in “Output: (Text/Encrypted Text)” panel (see Figure 13).
User also can see the execution time of the encryption and decryption process.
4.6. Proposed Model of Data Storage in Cloud Using the Proposed Algorithm
In Figure 14, the authors provide a view of using the algorithm in cloud platform in which data will be encrypted and decrypted using the proposed algorithm. The proposed algorithm takes data from sender, encrypts it and stored
Figure 9. Interface of the algorithm in JAVA.
Figure 10. Encryption of data in Java interface.
Figure 11. Encrypted text and hash value.
Figure 12. Decryption of encrypted text in Java interface.
Figure 13. Original plain text.
Figure 14. Proposed model of data storage in cloud using the proposed algorithm.
the cipher text in cloud, the key and hash code are stored in a database which is also stored in cloud. When a receiver request the data, he gets the cipher text from cloud, then he request for key and hash code from data base, after getting the hash code and key, the receiver decrypts the data using the proposed algorithm and gets the original plain text.
5. Result Discussion
The result has tested by:
Intel®Core™i5-7200UCPU@2.50 GHz 2.71 GHz.
8 GB RAM.
In Table 81, the authors analyze the algorithm with the same key and same message size for different types of data.
In Table 82, the authors compare the algorithm with AES, DES.
Graphical Representation of Encryption and Decryption time for 192-bit data among the proposed algorithm, AES and DES (see Figure 15).
Graphical Representation of Encryption and Decryption time for 384-bit data among the proposed algorithm, AES and DES (see Figure 16).
Graphical Representation of Encryption and Decryption time for 576-bit data among the proposed algorithm, AES and DES (see Figure 17).
Figure 15. Encryption and decryption for 192-bit data.
Figure 16. Encryption and decryption for 384-bit data.
Table 81. Algorithm analysis with the same key and same message size.
Figure 17. Encryption and decryption for 576 bit data.
Table 82. Comparison of proposed algorithm with AES, DES.
The main purpose of the algorithm is to provide security to data stored in cloud. For this purpose, the authors used a symmetric algorithm. They used various methods to further enhance the algorithm which can easily be used for encrypting data stored in cloud. The algorithm works on block wise. The algorithm takes up to 192 bits block of data at a time and encrypts them into cipher text. The algorithm encrypts and decrypts the data in 12 rounds. The algorithm used 192-bit key that’s why it provides better security. Symmetric algorithms are used widely around the world to store private data and since this algorithm will also be used to encrypt private data, that’s why authors thought of using a symmetric algorithm. The algorithm developed by the authors ensures data confidentiality, integrity and authenticity for data stored in cloud.
1) It works on text format data only.
2) Key and Hash code exchange is not much secure.
6.3. Future Works
1) Audio, video, image and file encryption.
2) Providing better security on Key and Hash code exchange.