Performance-Driven Encryption for Cloud Data Transmission and Storage Security

Performance-Driven Encryption for Cloud Data Transmission and Storage Security | Research Square window.SnipcartSettings = { analytics: { enabled: false } }; (function() { var accessVector = localStorage.getItem('access_vector') || ''; window.dataLayer = window.dataLayer || []; if (accessVector) { window.dataLayer.push({ user: { profile: { profileInfo: { snid: accessVector } } } }); } })(); (function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start':new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0],j=d.createElement(s),dl=l!='dataLayer'?'&l='+l:'';j.async=true;j.src='https://www.googletagmanager.com/gtm.js?id='+i+dl;f.parentNode.insertBefore(j,f);})(window,document,'script','dataLayer','GTM-K279D39R'); Browse Preprints In Review Journals COVID-19 Preprints AJE Video Bytes Research Tools Research Promotion AJE Professional Editing AJE Rubriq About Preprint Platform In Review Editorial Policies Our Team Advisory Board Help Center Sign In Submit a Preprint Cite Share Download PDF Research Article Performance-Driven Encryption for Cloud Data Transmission and Storage Security sagrika, Dr.Raj Kumar, Dr.Gursewak Singh Brar This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-5454587/v1 This work is licensed under a CC BY 4.0 License Status: Posted Version 1 posted You are reading this latest preprint version Abstract As cloud technology continues to grow at a rapid pace, it offers substantial advantages to the IT sector, including scalability, cost savings, and ease of access. However, protecting data stored in the cloud remains a critical challenge, with increasing vulnerabilities to unauthorized access and cyber threats. This paper presents a comprehensive method for enhancing cloud security by integrating encryption and compression techniques. The proposed approach begins by encrypting data through the Diffie-Hellman key exchange, followed by compression and encoding with Huffman coding to reduce data size while strengthening security. A second layer of encryption is then applied using the AES algorithm, resulting in a dual-encryption framework that enhances both protection and storage efficiency. The primary goal of this research is to deliver a secure, efficient solution for safeguarding cloud data in a resource-conscious manner. Computer Architecture and Engineering Cryptography Diffie-Hellman AES Encryption Huffman Encoding Method Figures Figure 1 Figure 2 Figure 3 Figure 4 1. Introduction Cryptography is a fundamental and highly effective method for securing data against unauthorized access by employing two core processes: encryption and decryption. Through encryption, plaintext is transformed into ciphertext—a format that is unreadable without the proper decryption key. This transformation ensures that sensitive information remains protected, even if intercepted during transmission or storage, as only those with the correct key can decode it. In cloud computing, data security is paramount due to the risks of unauthorized access. Key-exchange protocols, including Diffie-Hellman (DH), Elliptic-Curve Cryptography (ECC), and Elliptic-Curve Diffie-Hellman (ECDH), are essential for establishing secure communication channels, enabling two parties to securely share encryption keys over an unsecured network. By employing secret keys, cryptography ensures that data remains unintelligible to unauthorized users, maintaining confidentiality in cloud storage and transmission. Huffman Coding, a lossless data compression technique introduced by Dr. David A. Huffman in 1952, reduces redundancy by minimizing the number of bits needed to represent a sequence of symbols. This efficient coding technique is valuable in cloud environments, where reduced file size can optimize storage and transmission. The Advanced Encryption Standard (AES) is among the fastest and most secure encryption algorithms available today. Known for its efficiency, low memory usage, and strong resistance against attacks like key recovery, differential, and square attacks, AES is a widely trusted encryption method. It provides high performance with minimal storage requirements, making it an ideal choice for cloud data security. A reliable key-agreement protocol is critical for secure data transmission, as any compromise in this protocol jeopardizes the entire communication process. Combining cryptographic techniques like Diffie-Hellman and AES with compression methods such as Huffman Coding can offer a comprehensive solution for safeguarding cloud storage and communications. This integrated approach enhances security while optimizing storage and transmission efficiency. 2. Literature Review Year Author Title of Paper Proposed Algorithm 2014 Pratibha Tripathi et.al. [1] Security Issues On Cloud Computing In this paper the author presents the security issue in the cloud computing from the organization's view who stores their information in a cloud computing environment. 2015 Harshavard han Kayarkar et.al. [2] A Survey On Various Data Hiding Techniques And Their Comparative Analysis In this paper the author analysis various data encryption techniques and the key difference between steganography and cryptography. 2019 R Shanthaku mari et.al. [3] Dual-Layer Security Of Image Steganography Based On IDEA And LSBG Algorithm In The Cloud Environment In this paper the author presents a proposal for the IDEA (International Data Encryption Standard Algorithm) and Least Significant Bit Grouping(LSBG) technique for embedding the secret message into an original image. 2020 Dr. Kiramat Ullah et.al. [4] Comparison Of Various Encryption Algorithms For Securing Data In this paper the authors examined many encryption algorithms of data security. The performance of encryption algorithms is analysed based on speed, implementation technique, keysize, and efficiency in h/w and s/w. As a result, the author came on conclusion that the AES is the best encryption algorithm for preventing data spoofing. 2015 P.Ravi et.al. [5] A Study Of various Data Compression Techniques In this paper, authors given a detailed analysis of various data compression techniques for secure and effective communication as well as increased storage capacity. 2016 Aparna G. Korde [6] A Solution To Cloud Security: Image Steganography In this paper, The authors focused on the classification of data hiding methods in cloud computing. According to author the digital image is very powerful tool. 2022 Priya Singh et al.[7] A comparative study of Modern Encryption Techniques for Cloud Data Security Conducts a Comparative Analysis of modern encryption algorithms like AES,Blowfish and ChaCha20 for securing cloud data. 2023 Ashok Kumar et al.[12] Secure Data Compression and Encryption in Cloud Using Hybrid Huffman-AES Algorithm Proposes a hybrid approach using Huffman Coding for Compression followed by AES encryption to optimize storage and enhance security. 2019 Mustafa Sabah Taha et.al. [7] Combination of Steganography and Cryptography: A Shor Survey In this paper The author proposed a hybrid system using a combination of steganography and cryptographic techniques. As per author, by combining both these provide superior security and robustness. 2012 P. Yellamma et.al. [8] Performance Analysis Of Different Data Compression Techniques On Text File In This paper, authors compare and contrast different data compression techniques in this paper. This paper discusses various lossless data compression algorithms as well as how to calculate the entropy of a text file. For text compression the Huffman encoding algorithm is more efficient according to this paper. 2016 Hamza Tariq Khan et.al. [9] Improved Image Steganography Algorithm Using Huffman Codes In this paper the author discussed image steganography and how it is implemented using the Least Significant Bit technique. To compress the data in the carrier and achieve stegnography, the Huffman coding algorithm is used. 2015 Bharat Sinha [10] Comparison of PNG & JPEG Format For LSB Steganography In this paper the author used various mediums and formats to analyse the concept of steganography, In addition, the LSB technique was used to compare image steganography methods for two formats i.e for JPEG and PNG formats. 2010 Sujay Narayana et.al. [11] Two New Approaches For Secured Image steganography Using Cryptographic techniques And Type Conversions In this paper authors proposed using steganography and cryptography to prevent steganalysis using DES and stegnography techniques. 2017 Mr. Jayesh Surana et.al. [13] Steganography Techniques In this paper the authors analysed and compared the strengths and weaknesses of various steganography techniques And explained how to use the ISB, LSB, and MLSB tehniques in steganography for enhancing data security and data hiding. 3. Proposed Encoded-DHA Encryption Algorithm The main proposed methodology for the Encoded-DHA algorithm involves the following steps: Generate Random Data : Start by generating random digital data to be used in the encryption process. Apply Enhanced Diffie-Hellman Key Exchange : Utilize the enhanced Diffie-Hellman key exchange algorithm to securely encrypt the generated data, ensuring secure key sharing between communicating parties. Perform Huffman Encoding and Compression : Compress and encode the encrypted data using the Huffman encoding algorithm. This step not only reduces the data size but also adds an additional layer of security through efficient encoding. Encrypt with AES : Finally, apply the AES encryption algorithm to the compressed and encoded data, ensuring a second layer of encryption for enhanced security. The Huffman encoding algorithm protects the Diffie-Hellman algorithm from an attacker. As a result, Encoded-DH is highly resistant to attackers and can safely compute shared secret keys. We proposed an algorithm to protect data from attackers in this paper. Advanced Encryption Standard AES is a symmetric cryptography block cipher algorithm [4]. Rijndael is the name given to it. From AES key schedule method, the round keys comes from the secret key. AES also applies an XOR operation in every byte of the state in order to combine it with each byte of the round key, which is called as AddRoundKey. In a nonlinear substitution step known as SubBytes, A lookup table is used to replace each byte with another. The last three rows of state are shifted cyclically a few number of steps in a transposition step called as ShiftRows. MixColumns performs a linear mixing operation on the state's columns to combine the four bytes in each column. AES delivers every round with four steps: Step1.SubBytes, Step2.ShiftRows, Step3.MixColumns, and Step14. AddRoundKey Diffie-Hellman Cryptography The Diffie-Hellman key exchange algorithm is shown in Table 1. Over the public channel, sender and receiver both share two prime numbers i.e., P and g, at first. TABLE 1 Diffie-Hellman Key Exchange Protocol to generate three secret key Sender A Attacker E Receiver B P P P g G G a B A = g a mod P B = g b mod P B A , B A SK = B a mod P SK = A b mod P Using a true-random number generator, it generates A and B as two random key i.e., a and b, respectively. The keys a and b are both kept hidden. A = g a mod P is computed by the A, and the A is sent to B. In the same way, the B calculates B = g b mod P and sends it to A. The shared secret keys SK = B a mod P and SK = A b mod P can be computed by the A and B, respectively. [5] Huffman coding Huffman Coding is employed in lossless data compression. It applies variable-size method for encoding. It denotes all characters with variable size code. The smallest code is assigned to the most frequently appearing character. The highest code is assigned to the character who appears the fewest times. A rule known as a prefix rule is used in Huffman coding. This is done to prevent ambiguity during decoding. It ensures that no character's code is a prefix of any other character's code[8]. Huffman Coding Procedures • Using the input character to create a Huffman Tree. • Using the Huffman tree to assign code to the characters. Block Diagram of proposed Work The Huffman encoding algorithm protects the Diffie-Hellman algorithm from an attacker. As a result, Encoded-DH is resistant to attackers and can compute a shared secure secret key. There are several steps in the encryption process. First, a random number N is entered. Following that, the plaintext is encrypted using the enhanced Diffie-Hellman key exchange algorithm. Implement the Huffman encoding algorithm to increase security by encrypting and compressing encrypted data. After that, AES encryption is used to encrypt the compressed data and provide connection authentication. Pseudo code Generate random data ( 0 to 255) i.e. message m Generate key using Diffie Hellman Key Exchange Perform XOR operation on message with key and generate cipher data Apply compression on cipher data using Huffman encoding Now Apply AES encryption algorithm S=C is compress data AddRoundKey(state, &X[0]) for i=1 step 1 to 9 SubBytes(S) ShifRows(S) MixColumns(S) AddRoundKey(S, &X[i]*4) end for SubBytes(S) Shift Rows(S) AddRoundKey(S, &X[40]) Data Encrypted 4. Results This table compares three encryption algorithms—AES, RSA, and a proposed algorithm—across several parameters: key size, storage requirements, encryption time, decryption time, and total processing time. Type of Algorithm : Three algorithms are listed—AES (Advanced Encryption Standard), RSA (Rivest-Shamir-Adleman), and the "Proposed" algorithm. Key Size : AES uses a 128-bit key, RSA uses a 1024-bit key, and the proposed algorithm uses a 16-character string, equivalent to a 128-bit key. Storage : Both AES and RSA require more storage space, whereas the proposed algorithm requires less, which can make it more efficient for storage-constrained environments. Encryption Time : AES has an encryption time of 0.011895 seconds, RSA has a much longer encryption time at 0.50241 seconds, while the proposed algorithm’s encryption time is 0.015577 seconds, which is slightly longer than AES but significantly faster than RSA. Decryption Time : AES decryption takes 0.002815 seconds, RSA takes 0.6844 seconds (the longest of the three), and the proposed algorithm’s decryption time is 0.01568 seconds, slightly higher than AES but again faster than RSA. Total Processing Time : This is the sum of encryption and decryption times. AES has a total processing time of 0.12176 seconds, RSA takes the longest with 1.1868 seconds, and the proposed algorithm has the shortest total time at 0.031257 seconds. Table2: Comparison of Results with AES,RSA and Proposed Algorithms Type of Algorithm Key Size Storage Encryption Time Decryption Time Total Processing Time AES 128 bits More 0.011895 0.002815 0.12176 RSA 1024 bits More 0.50241 0.6844 1.1868 Proposed 16character string(128 bits) Less 0.015577 0.01568 0.031257 In summary, the proposed algorithm demonstrates better efficiency in terms of storage and processing time compared to both AES and RSA, making it potentially more suitable for secure data transmission and storage, especially in environments where storage and speed are critical. 5. Conclusion The proposed problem is primarily related to data security in a cloud environment. In the solution compression and cryptography techniques are combined to increase the level of data security. The encoded-DHA algorithm, derived from the conventional Diffie-Hellman algorithm and AES, has been proposed in this paper. In the insecure channel, the traditional Diffie-Hellman algorithm shares the numbers publicly, thats why attacks on the Diffie-Hellman algorithm, such as Logjam, are possible. As a result, this paper proposes Encoded-DHA with AES as a solution to the security problem. The proposed methodology ensures data security while also compressing it. There is no communication overhead with encoded-DHA. Encoded-DHA also demonstrates its high resistance to attacks. Encoded-DH can provide a high level of security. References Pratibha Tripathi, Mohammad Suaib “Security Issues On Cloud Computing ” International Journal Of Engineering Technology, Management And Applied Sciences November 2014, Volume 2 Issue 6, ISSN 2349-4476. Harshavardhankayarkar, Sugata Sanyal “A Survey On Various Data Hiding Techniques And Their Comparative Analysis” M.G.M‟S College Of Engineering And Technology, Navi Mumbai, India Sugata Sanyal School Of Technology And Computer Science, Tata Institute Of Fundamental Research, Mumbai, India. R Shanthakumari and S Malliga” Dual-Layer Security Of Image Steganography Based On IDEA And LSBG Algorithm In The Cloud Environment” Indian Academy Of Sciences Received 23 August 2018; Revised 20 February 2019; Accepted 11 March 2019; Published Online 20 April 2019. Dr. Kiramatullah, Bibi Ayisha, Farrukh Irfan, Inaamillahi, Zeeshan Tahir “Comparison Of Various Encryption Algorithms For Securing Data” Pakistan Institute Of Engineering And Applied Sciences (PIEAS). Ravi, Dr. A. Ashokkumar “A Study Ofvarious Data Compression Techniques” International Journal Of Computer Science & Communication Volume 6,Issue 2 April –September 2015. Aparna G. Korde “ A Solution To Cloud Security : Image Steganography “ Epitome journals International Journal Of Multidisciplinary Vol. 2, Issue 2, February 2016, ISSN: 2395-6968. Mustafa Sabah Taha1,3, Mohdshafrymohd Rahim1,2, Sameer Abdulsattar Lafta4, Mohammed mahdihashim1,5,Hassanainmahdialzuabidi6 “Combination of Steganography and Cryptography: A Shor Survey” IOP Conference Series: Materials Science And Engineering. P. Yellammadr. Narasimhamchalla “Performance Analysis Of Different Data Compression Techniques On Text File” International Journal Of Engineering Research & Technology (IJERT) Vol. 1 Issue 8, October –2012 ISSN: 2278-0181 Hamza Tariq Khan, Heebah Saleem,” Improved Image Steganography Algorithm Using Huffman Codes” International Journal Of Computer Applications (0975 –8887) Volume 147 – No.12, August 2016 Bharat Sinha ”Comparison Of PNG & JPEG Format For LSB Steganography” International Journal Of Science And Research (IJSR), Volume 4 Issue 4, April 2015, ISSN (Online): 2319-7064. Sujay Narayana1and Gaurav Prasad “Two New Approaches For Secured Image steganography Using Cryptographic techniques And Type Conversions”, Signal & Image Processing : An International Journal(SIPIJ) Vol.1, No.2, December 2010. Monica Adriana Dagadita, Emilioanslus¸ Anschi, Razvandobre,” Data Hiding Using Steganography”, Conference Paper · June 2013 Mr. Jayesh Surana, Aniruddhsonsale, Bhavesh Joshi, Deepesh Sharma, Nilesh Choudhary,” Steganography Techniques” , International Journal Of Engineering Development And Research, 2017 IJEDR | Volume 5. Mohammed Sabri Abuali, C.B.M. Rashidi, Muataz H. Salih, R. A. A. Raof,Safa Saad Hussein. In This Paper The Author,” Digital Image Steganography In Spatial Domain Comprehensive Review”, Journal Of Theoretical And Applied Information Technology15th October 2019. Vol.97. No 19. Additional Declarations The authors declare no competing interests. Cite Share Download PDF Status: Posted Version 1 posted You are reading this latest preprint version Research Square lets you share your work early, gain feedback from the community, and start making changes to your manuscript prior to peer review in a journal. As a division of Research Square Company, we’re committed to making research communication faster, fairer, and more useful. We do this by developing innovative software and high quality services for the global research community. Our growing team is made up of researchers and industry professionals working together to solve the most critical problems facing scientific publishing. Also discoverable on Platform About Our Team In Review Editorial Policies Advisory Board Help Center Resources Author Services Accessibility API Access RSS feed Manage Cookie Preferences © Research Square 2026 | ISSN 2693-5015 (online) Privacy Policy Terms of Service Do Not Sell My Personal Information {"props":{"pageProps":{"initialData":{"identity":"rs-5454587","acceptedTermsAndConditions":true,"allowDirectSubmit":true,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":378185229,"identity":"62338fea-66db-48a8-b923-84b443c1ac64","order_by":0,"name":"sagrika","email":"","orcid":"","institution":"RIMT","correspondingAuthor":false,"prefix":"","firstName":"","middleName":"","lastName":"sagrika","suffix":""},{"id":378185230,"identity":"cfdc30c7-9215-44da-b49e-fe4aaeb66bba","order_by":1,"name":"Dr.Raj Kumar","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAA2UlEQVRIiWNgGAWjYHCCBMYGEMXewHAAIgDhE6GF5wBQSwJxWqBKJEDKE4hwlXn7gQeMM9u2yZvPfPvw0M0fDPL8DcxtD/BpkTmTkMC4se224Zzb6QaHcxIYDGccYGw3wKdFggGo5WHbbcYZ0mkMIC2MGxgY2yTwauF/ANZiP0PyGFiLPWEtEhCHJc6QYANrSSRCy4OEgzPO3U6ewQNyWJpE8ozDBB2Wk/iwp+y27Qz2Y8yfc2xsbPvb25/h1QKMwoQDyEYwMDDjVw8E7AcIKhkFo2AUjIIRDgDDYUmdYtrZawAAAABJRU5ErkJggg==","orcid":"","institution":"RIMT","correspondingAuthor":true,"prefix":"Dr.","firstName":"Raj","middleName":"","lastName":"Kumar","suffix":""},{"id":378185231,"identity":"d82c6c81-7250-4cd2-b06a-bbfc77969774","order_by":2,"name":"Dr.Gursewak Singh Brar","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAABHUlEQVRIiWNgGAWjYBADAwYGxgYgskkwYOCBijETpyWNJC0MIF2HkbTgAPIRuY8/fGyzM2bgP9z28OuO83nm/GcPPvjBYCfPwM57AJsWwxvpZpIz25LNGCQS241lz9wutpyRl2zYw5Bs2MDMl4BVy4w0Nmbebcw2DBKMbdKSbbcTN9zgMZMGeiSBgZnHAIcW5s9/t9XbMPAfBGk5l7jh/Bnz3wwM9Ti1yEukMUgzbjtsxsCQ2Cb5se1A4oYDOWbAsDqMU4sBzzM2yd5/x43ZJBLbpBnbksF+kewxOG7YhsuW9jTmDz/OVBv28x9/JvmzzQ4cYh9+VFTL8/OfwW7LASiDDYiZETFiABHBaksDEofxBw5Vo2AUjIJRMLIBAFtRWSN9OoO2AAAAAElFTkSuQmCC","orcid":"","institution":"BBSBEC","correspondingAuthor":true,"prefix":"Dr.","firstName":"Gursewak","middleName":"Singh","lastName":"Brar","suffix":""}],"badges":[],"createdAt":"2024-11-14 14:20:14","currentVersionCode":1,"declarations":{"humanSubjects":true,"vertebrateSubjects":true,"conflictsOfInterestStatement":false,"humanSubjectEthicalGuidelines":true,"humanSubjectConsent":true,"humanSubjectClinicalTrial":false,"humanSubjectCaseReport":false,"vertebrateSubjectEthicalGuidelines":true},"doi":"10.21203/rs.3.rs-5454587/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-5454587/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":69057258,"identity":"08a8570f-8bfb-41f8-8c6c-a686b389997c","added_by":"auto","created_at":"2024-11-15 06:48:15","extension":"png","order_by":1,"title":"Figure 1","display":"","copyAsset":false,"role":"figure","size":40317,"visible":true,"origin":"","legend":"\u003cp\u003eProposed Encoded-DHA algorithm Block Diagram\u003c/p\u003e","description":"","filename":"1.png","url":"https://assets-eu.researchsquare.com/files/rs-5454587/v1/9ec80f7deb752da897599fdd.png"},{"id":69058337,"identity":"cece1926-5490-4434-99cc-8227880ff999","added_by":"auto","created_at":"2024-11-15 06:56:16","extension":"png","order_by":2,"title":"Figure 2","display":"","copyAsset":false,"role":"figure","size":148037,"visible":true,"origin":"","legend":"\u003cp\u003eInput\u0026nbsp;\u003c/p\u003e","description":"","filename":"4.png","url":"https://assets-eu.researchsquare.com/files/rs-5454587/v1/8a4a58887f4abfd2c1a6dead.png"},{"id":69057259,"identity":"d7a1f6a5-7840-44af-95cf-03e109634b62","added_by":"auto","created_at":"2024-11-15 06:48:16","extension":"png","order_by":3,"title":"Figure 3","display":"","copyAsset":false,"role":"figure","size":218323,"visible":true,"origin":"","legend":"\u003cp\u003eencryption results\u003c/p\u003e","description":"","filename":"5.png","url":"https://assets-eu.researchsquare.com/files/rs-5454587/v1/fdf05625f5e5be77906b19c8.png"},{"id":69058336,"identity":"cf9a6ce1-1d59-4352-818c-895012e3e2a3","added_by":"auto","created_at":"2024-11-15 06:56:16","extension":"png","order_by":4,"title":"Figure 4","display":"","copyAsset":false,"role":"figure","size":145740,"visible":true,"origin":"","legend":"\u003cp\u003eComparison Graph\u003c/p\u003e","description":"","filename":"6.png","url":"https://assets-eu.researchsquare.com/files/rs-5454587/v1/40b3043f1a3f0e5083926734.png"},{"id":69058338,"identity":"0ef0a671-c229-4ce7-bfe1-c73a04b035fb","added_by":"auto","created_at":"2024-11-15 06:56:20","extension":"pdf","order_by":0,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":960241,"visible":true,"origin":"","legend":"","description":"","filename":"manuscript.pdf","url":"https://assets-eu.researchsquare.com/files/rs-5454587/v1/8ed52fa2-a96f-45bd-9a46-5b61242ae96b.pdf"}],"financialInterests":"The authors declare no competing interests.","formattedTitle":"\u003cp\u003e\u003cstrong\u003ePerformance-Driven Encryption for Cloud Data Transmission and Storage Security\u003c/strong\u003e\u003c/p\u003e","fulltext":[{"header":"1. Introduction","content":"\u003cp\u003eCryptography is a fundamental and highly effective method for securing data against unauthorized access by employing two core processes: encryption and decryption. Through encryption, plaintext is transformed into ciphertext\u0026mdash;a format that is unreadable without the proper decryption key. This transformation ensures that sensitive information remains protected, even if intercepted during transmission or storage, as only those with the correct key can decode it.\u003c/p\u003e\n\u003cp\u003eIn cloud computing, data security is paramount due to the risks of unauthorized access. Key-exchange protocols, including Diffie-Hellman (DH), Elliptic-Curve Cryptography (ECC), and Elliptic-Curve Diffie-Hellman (ECDH), are essential for establishing secure communication channels, enabling two parties to securely share encryption keys over an unsecured network.\u003c/p\u003e\n\u003cp\u003eBy employing secret keys, cryptography ensures that data remains unintelligible to unauthorized users, maintaining confidentiality in cloud storage and transmission. Huffman Coding, a lossless data compression technique introduced by Dr. David A. Huffman in 1952, reduces redundancy by minimizing the number of bits needed to represent a sequence of symbols. This efficient coding technique is valuable in cloud environments, where reduced file size can optimize storage and transmission.\u003c/p\u003e\n\u003cp\u003eThe Advanced Encryption Standard (AES) is among the fastest and most secure encryption algorithms available today. Known for its efficiency, low memory usage, and strong resistance against attacks like key recovery, differential, and square attacks, AES is a widely trusted encryption method. It provides high performance with minimal storage requirements, making it an ideal choice for cloud data security.\u003c/p\u003e\n\u003cp\u003eA reliable key-agreement protocol is critical for secure data transmission, as any compromise in this protocol jeopardizes the entire communication process. Combining cryptographic techniques like Diffie-Hellman and AES with compression methods such as Huffman Coding can offer a comprehensive solution for safeguarding cloud storage and communications. This integrated approach enhances security while optimizing storage and transmission efficiency.\u003c/p\u003e"},{"header":"2. Literature Review","content":"\u003ctable border=\"1\" cellspacing=\"0\" cellpadding=\"0\" width=\"93%\"\u003e\n \u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd valign=\"top\" style=\"width: 8.16327%;\"\u003e\n \u003cp\u003eYear\u003c/p\u003e\n \u003c/td\u003e\n \u003ctd valign=\"top\" style=\"width: 17.3469%;\"\u003e\n \u003cp\u003eAuthor\u003c/p\u003e\n \u003c/td\u003e\n \u003ctd valign=\"top\" style=\"width: 32.6531%;\"\u003e\n \u003cp\u003eTitle\u0026nbsp;of\u0026nbsp;Paper\u003c/p\u003e\n \u003c/td\u003e\n \u003ctd valign=\"top\" style=\"width: 41.8367%;\"\u003e\n \u003cp\u003eProposed\u003c/p\u003e\n \u003cp\u003eAlgorithm\u003c/p\u003e\n \u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd valign=\"top\" style=\"width: 8.16327%;\"\u003e\n \u003cp\u003e2014\u003c/p\u003e\n \u003c/td\u003e\n \u003ctd valign=\"top\" style=\"width: 17.3469%;\"\u003e\n \u003cp\u003e\u003cstrong\u003ePratibha Tripathi\u0026nbsp;\u003c/strong\u003e\u003cstrong\u003eet.al.\u0026nbsp;\u003c/strong\u003e[1]\u003c/p\u003e\n \u003c/td\u003e\n \u003ctd valign=\"top\" style=\"width: 32.6531%;\"\u003e\n \u003cp\u003eSecurity Issues On\u0026nbsp;Cloud\u0026nbsp;Computing\u003c/p\u003e\n \u003c/td\u003e\n \u003ctd valign=\"top\" style=\"width: 41.8367%;\"\u003e\n \u003cp\u003eIn this paper the author presents the security issue in the \u0026nbsp;cloud computing from the organization\u0026apos;s view who stores their information in a cloud computing environment.\u003c/p\u003e\n \u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd valign=\"top\" style=\"width: 8.16327%;\"\u003e\n \u003cp\u003e2015\u003c/p\u003e\n \u003c/td\u003e\n \u003ctd valign=\"top\" style=\"width: 17.3469%;\"\u003e\n \u003cp\u003e\u003cstrong\u003eHarshavard\u0026nbsp;\u003c/strong\u003e\u003cstrong\u003ehan\u0026nbsp;\u003c/strong\u003e\u003cstrong\u003eKayarkar\u0026nbsp;\u003c/strong\u003e\u003cstrong\u003eet.al.\u0026nbsp;\u003c/strong\u003e[2]\u003c/p\u003e\n \u003c/td\u003e\n \u003ctd valign=\"top\" style=\"width: 32.6531%;\"\u003e\n \u003cp\u003eA \u0026nbsp;Survey On Various Data Hiding Techniques And Their Comparative Analysis\u003c/p\u003e\n \u003c/td\u003e\n \u003ctd valign=\"top\" style=\"width: 41.8367%;\"\u003e\n \u003cp\u003eIn this paper\u0026nbsp;the\u0026nbsp;author analysis\u0026nbsp;various data\u0026nbsp;encryption techniques and the key\u0026nbsp;difference between steganography and cryptography.\u003c/p\u003e\n \u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd valign=\"top\" style=\"width: 8.16327%;\"\u003e\n \u003cp\u003e2019\u003c/p\u003e\n \u003c/td\u003e\n \u003ctd valign=\"top\" style=\"width: 17.3469%;\"\u003e\n \u003cp\u003e\u003cstrong\u003eR\u003c/strong\u003e\u003c/p\u003e\n \u003cp\u003e\u003cstrong\u003eShanthaku\u0026nbsp;\u003c/strong\u003e\u003cstrong\u003emari\u003c/strong\u003e\u003cstrong\u003e\u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp;\u0026nbsp;\u003c/strong\u003e\u003cstrong\u003eet.al.\u0026nbsp;\u003c/strong\u003e[3]\u003c/p\u003e\n \u003c/td\u003e\n \u003ctd valign=\"top\" style=\"width: 32.6531%;\"\u003e\n \u003cp\u003eDual-Layer Security Of\u0026nbsp;Image\u0026nbsp;Steganography\u0026nbsp;Based\u0026nbsp;On\u0026nbsp;IDEA And LSBG\u0026nbsp;Algorithm\u0026nbsp;In\u0026nbsp;The Cloud Environment\u003c/p\u003e\n \u003c/td\u003e\n \u003ctd valign=\"top\" style=\"width: 41.8367%;\"\u003e\n \u003cp\u003eIn this paper\u0026nbsp;the\u0026nbsp;author presents\u0026nbsp;a proposal for the IDEA\u0026nbsp;(International Data Encryption Standard\u0026nbsp;Algorithm)\u0026nbsp;and\u0026nbsp;Least\u0026nbsp;Significant\u0026nbsp;Bit Grouping(LSBG) technique for embedding the secret message into\u0026nbsp;an\u0026nbsp;original image.\u003c/p\u003e\n \u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd valign=\"top\" style=\"width: 8.16327%;\"\u003e\n \u003cp\u003e2020\u003c/p\u003e\n \u003c/td\u003e\n \u003ctd valign=\"top\" style=\"width: 17.3469%;\"\u003e\n \u003cp\u003e\u003cstrong\u003eDr. Kiramat Ullah\u0026nbsp;\u003c/strong\u003e\u003cstrong\u003eet.al.\u0026nbsp;\u003c/strong\u003e[4]\u003c/p\u003e\n \u003c/td\u003e\n \u003ctd valign=\"top\" style=\"width: 32.6531%;\"\u003e\n \u003cp\u003eComparison \u0026nbsp; \u0026nbsp; \u0026nbsp;Of Various Encryption Algorithms \u0026nbsp; \u0026nbsp; For Securing Data\u003c/p\u003e\n \u003c/td\u003e\n \u003ctd valign=\"top\" style=\"width: 41.8367%;\"\u003e\n \u003cp\u003eIn\u0026nbsp;this\u0026nbsp;paper the authors examined many encryption algorithms of data security. The performance of encryption algorithms is analysed based on speed, implementation technique, keysize, and efficiency in h/w and s/w. As a result, the author came on conclusion that the AES is the best encryption algorithm for preventing data spoofing.\u003c/p\u003e\n \u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd valign=\"top\" style=\"width: 8.16327%;\"\u003e\n \u003cp\u003e2015\u003c/p\u003e\n \u003c/td\u003e\n \u003ctd valign=\"top\" style=\"width: 17.3469%;\"\u003e\n \u003cp\u003e\u003cstrong\u003eP.Ravi \u0026nbsp;\u003c/strong\u003e\u003cstrong\u003eet.al.\u003c/strong\u003e\u003c/p\u003e\n \u003cp\u003e[5]\u003c/p\u003e\n \u003c/td\u003e\n \u003ctd valign=\"top\" style=\"width: 32.6531%;\"\u003e\n \u003cp\u003eA \u0026nbsp; \u0026nbsp; \u0026nbsp; Study \u0026nbsp; \u0026nbsp; \u0026nbsp; Of\u003c/p\u003e\n \u003cp\u003evarious \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp; \u0026nbsp;Data Compression Techniques\u003c/p\u003e\n \u003c/td\u003e\n \u003ctd valign=\"top\" style=\"width: 41.8367%;\"\u003e\n \u003cp\u003eIn\u0026nbsp;this\u0026nbsp;paper, authors\u0026nbsp;given a detailed analysis of various data compression techniques for secure and effective communication as well as increased storage capacity.\u003c/p\u003e\n \u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd valign=\"top\" style=\"width: 8.16327%;\"\u003e\n \u003cp\u003e2016\u003c/p\u003e\n \u003c/td\u003e\n \u003ctd valign=\"top\" style=\"width: 17.3469%;\"\u003e\n \u003cp\u003e\u003cstrong\u003eAparna\u003c/strong\u003e\u003cstrong\u003e\u0026nbsp; \u0026nbsp; \u0026nbsp;G. Korde\u0026nbsp;\u003c/strong\u003e[6]\u003c/p\u003e\n \u003c/td\u003e\n \u003ctd valign=\"top\" style=\"width: 32.6531%;\"\u003e\n \u003cp\u003eA \u0026nbsp; \u0026nbsp; Solution To Cloud Security: Image Steganography\u003c/p\u003e\n \u003c/td\u003e\n \u003ctd valign=\"top\" style=\"width: 41.8367%;\"\u003e\n \u003cp\u003eIn this paper, The authors\u0026nbsp;focused on the classification of data hiding methods in cloud computing. According to author the digital image is very powerful tool.\u003c/p\u003e\n \u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd valign=\"top\" style=\"width: 8.16327%;\"\u003e\n \u003cp\u003e2022\u003c/p\u003e\n \u003c/td\u003e\n \u003ctd valign=\"top\" style=\"width: 17.3469%;\"\u003e\n \u003cp\u003e\u003cstrong\u003ePriya Singh et al.[7]\u003c/strong\u003e\u003c/p\u003e\n \u003c/td\u003e\n \u003ctd valign=\"top\" style=\"width: 32.6531%;\"\u003e\n \u003cp\u003eA comparative study of Modern Encryption Techniques for Cloud Data Security\u003c/p\u003e\n \u003c/td\u003e\n \u003ctd valign=\"top\" style=\"width: 41.8367%;\"\u003e\n \u003cp\u003eConducts a Comparative Analysis of modern encryption algorithms like AES,Blowfish and ChaCha20 for securing cloud data.\u003c/p\u003e\n \u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd valign=\"top\" style=\"width: 8.16327%;\"\u003e\n \u003cp\u003e2023\u003c/p\u003e\n \u003c/td\u003e\n \u003ctd valign=\"top\" style=\"width: 17.3469%;\"\u003e\n \u003cp\u003e\u003cstrong\u003eAshok Kumar et al.[12]\u003c/strong\u003e\u003c/p\u003e\n \u003c/td\u003e\n \u003ctd valign=\"top\" style=\"width: 32.6531%;\"\u003e\n \u003cp\u003eSecure Data Compression and Encryption in Cloud Using Hybrid Huffman-AES Algorithm\u003c/p\u003e\n \u003c/td\u003e\n \u003ctd valign=\"top\" style=\"width: 41.8367%;\"\u003e\n \u003cp\u003eProposes a hybrid approach using Huffman Coding for Compression followed by AES encryption to optimize storage and enhance security.\u003c/p\u003e\n \u003c/td\u003e\n \u003c/tr\u003e\n \u003c/tbody\u003e\n\u003c/table\u003e\n\u003cp\u003e\u003cbr\u003e\u003c/p\u003e\n\u003ctable border=\"1\" cellspacing=\"0\" cellpadding=\"0\" width=\"588\"\u003e\n \u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd valign=\"top\" style=\"width: 6.80272%;\"\u003e\n \u003cp\u003e2019\u003c/p\u003e\n \u003c/td\u003e\n \u003ctd valign=\"top\" style=\"width: 19.7279%;\"\u003e\n \u003cp\u003e\u003cstrong\u003eMustafa Sabah Taha\u0026nbsp;\u003c/strong\u003e\u003cstrong\u003eet.al.\u0026nbsp;\u003c/strong\u003e[7]\u003c/p\u003e\n \u003c/td\u003e\n \u003ctd valign=\"top\" style=\"width: 32.6531%;\"\u003e\n \u003cp\u003eCombination\u0026nbsp;of Steganography\u0026nbsp;and Cryptography:\u0026nbsp;A Shor\u0026nbsp;Survey\u003c/p\u003e\n \u003c/td\u003e\n \u003ctd valign=\"top\" style=\"width: 40.8163%;\"\u003e\n \u003cp\u003eIn\u0026nbsp;this\u0026nbsp;paper The author proposed a hybrid system using a combination of steganography and cryptographic techniques. As per author, by combining both these provide superior security and robustness.\u003c/p\u003e\n \u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd valign=\"top\" style=\"width: 6.80272%;\"\u003e\n \u003cp\u003e2012\u003c/p\u003e\n \u003c/td\u003e\n \u003ctd valign=\"top\" style=\"width: 19.7279%;\"\u003e\n \u003cp\u003e\u003cstrong\u003eP.\u003c/strong\u003e\u003c/p\u003e\n \u003cp\u003e\u003cstrong\u003eYellamma\u003c/strong\u003e\u003c/p\u003e\n \u003cp\u003e\u003cstrong\u003eet.al.\u0026nbsp;\u003c/strong\u003e[8]\u003c/p\u003e\n \u003c/td\u003e\n \u003ctd valign=\"top\" style=\"width: 32.6531%;\"\u003e\n \u003cp\u003ePerformance Analysis \u0026nbsp; \u0026nbsp; Of\u003c/p\u003e\n \u003cp\u003eDifferent \u0026nbsp; \u0026nbsp; \u0026nbsp; Data Compression Techniques \u0026nbsp; \u0026nbsp; \u0026nbsp;On Text File\u003c/p\u003e\n \u003c/td\u003e\n \u003ctd valign=\"top\" style=\"width: 40.8163%;\"\u003e\n \u003cp\u003eIn This paper, authors compare and contrast different data compression techniques in this paper. This paper discusses various lossless data compression algorithms as well as how to calculate the entropy of a text file. For text compression the Huffman encoding algorithm is more efficient according to this paper.\u003c/p\u003e\n \u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd valign=\"top\" style=\"width: 6.80272%;\"\u003e\n \u003cp\u003e2016\u003c/p\u003e\n \u003c/td\u003e\n \u003ctd valign=\"top\" style=\"width: 19.7279%;\"\u003e\n \u003cp\u003e\u003cstrong\u003eHamza Tariq Khan\u0026nbsp;\u003c/strong\u003e\u003cstrong\u003eet.al.\u0026nbsp;\u003c/strong\u003e[9]\u003c/p\u003e\n \u003c/td\u003e\n \u003ctd valign=\"top\" style=\"width: 32.6531%;\"\u003e\n \u003cp\u003eImproved Image Steganography\u0026nbsp;Algorithm\u0026nbsp;Using Huffman Codes\u003c/p\u003e\n \u003c/td\u003e\n \u003ctd valign=\"top\" style=\"width: 40.8163%;\"\u003e\n \u003cp\u003eIn this paper the author discussed image steganography and how it is implemented using the Least Significant Bit technique. To compress the data in the carrier and achieve stegnography, the Huffman coding algorithm is used.\u003c/p\u003e\n \u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd valign=\"top\" style=\"width: 6.80272%;\"\u003e\n \u003cp\u003e2015\u003c/p\u003e\n \u003c/td\u003e\n \u003ctd valign=\"top\" style=\"width: 19.7279%;\"\u003e\n \u003cp\u003e\u003cstrong\u003eBharat Sinha\u003c/strong\u003e[10]\u003c/p\u003e\n \u003c/td\u003e\n \u003ctd valign=\"top\" style=\"width: 32.6531%;\"\u003e\n \u003cp\u003eComparison of \u0026nbsp;PNG \u0026amp; JPEG Format For LSB Steganography\u003c/p\u003e\n \u003c/td\u003e\n \u003ctd valign=\"top\" style=\"width: 40.8163%;\"\u003e\n \u003cp\u003eIn this paper the author used various mediums and formats to analyse the concept of steganography, In addition, the LSB technique was used to compare image steganography methods for two formats i.e for JPEG and PNG \u0026nbsp;formats.\u003c/p\u003e\n \u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd valign=\"top\" style=\"width: 6.80272%;\"\u003e\n \u003cp\u003e2010\u003c/p\u003e\n \u003c/td\u003e\n \u003ctd valign=\"top\" style=\"width: 19.7279%;\"\u003e\n \u003cp\u003e\u003cstrong\u003eSujay Narayana\u0026nbsp;\u003c/strong\u003e\u003cstrong\u003eet.al.\u0026nbsp;\u003c/strong\u003e[11]\u003c/p\u003e\n \u003c/td\u003e\n \u003ctd valign=\"top\" style=\"width: 32.6531%;\"\u003e\n \u003cp\u003eTwo\u0026nbsp;New Approaches\u0026nbsp;For Secured Image steganography Using Cryptographic\u0026nbsp;techniques\u0026nbsp;And Type\u0026nbsp;Conversions\u003c/p\u003e\n \u003c/td\u003e\n \u003ctd valign=\"top\" style=\"width: 40.8163%;\"\u003e\n \u003cp\u003eIn\u0026nbsp;this\u0026nbsp;paper authors proposed using steganography and cryptography to prevent steganalysis using DES and stegnography techniques.\u003c/p\u003e\n \u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd valign=\"top\" style=\"width: 6.80272%;\"\u003e\n \u003cp\u003e2017\u003c/p\u003e\n \u003c/td\u003e\n \u003ctd valign=\"top\" style=\"width: 19.7279%;\"\u003e\n \u003cp\u003e\u003cstrong\u003eMr. Jayesh Surana\u0026nbsp;\u003c/strong\u003e\u003cstrong\u003eet.al.\u0026nbsp;\u003c/strong\u003e[13]\u003c/p\u003e\n \u003c/td\u003e\n \u003ctd valign=\"top\" style=\"width: 32.6531%;\"\u003e\n \u003cp\u003eSteganography Techniques\u003c/p\u003e\n \u003c/td\u003e\n \u003ctd valign=\"top\" style=\"width: 40.8163%;\"\u003e\n \u003cp\u003eIn this paper the authors analysed and compared the strengths and weaknesses of various steganography techniques And explained how to use the ISB, LSB, and MLSB tehniques in steganography for enhancing data security and data hiding.\u003c/p\u003e\n \u003c/td\u003e\n \u003c/tr\u003e\n \u003c/tbody\u003e\n\u003c/table\u003e"},{"header":"3.\tProposed Encoded-DHA Encryption Algorithm","content":"\u003cp\u003eThe main proposed methodology for the \u003cstrong\u003eEncoded-DHA\u003c/strong\u003e algorithm involves the following steps:\u003c/p\u003e\n\u003col start=\"1\" type=\"1\"\u003e\n \u003cli\u003e\u003cstrong\u003eGenerate Random Data\u003c/strong\u003e: Start by generating random digital data to be used in the encryption process.\u003c/li\u003e\n \u003cli\u003e\u003cstrong\u003eApply Enhanced Diffie-Hellman Key Exchange\u003c/strong\u003e: Utilize the enhanced Diffie-Hellman key exchange algorithm to securely encrypt the generated data, ensuring secure key sharing between communicating parties.\u003c/li\u003e\n \u003cli\u003e\u003cstrong\u003ePerform Huffman Encoding and Compression\u003c/strong\u003e: Compress and encode the encrypted data using the Huffman encoding algorithm. This step not only reduces the data size but also adds an additional layer of security through efficient encoding.\u003c/li\u003e\n \u003cli\u003e\u003cstrong\u003eEncrypt with AES\u003c/strong\u003e: Finally, apply the AES encryption algorithm to the compressed and encoded data, ensuring a second layer of encryption for enhanced security.\u003c/li\u003e\n\u003c/ol\u003e\n\u003cp\u003eThe Huffman encoding algorithm protects the Diffie-Hellman algorithm from an attacker. As a result, Encoded-DH is highly resistant to attackers and can safely compute shared secret keys. We proposed an algorithm to protect data from attackers in this paper.\u003c/p\u003e\n\u003cp\u003eAdvanced\u0026nbsp;Encryption\u0026nbsp;Standard\u003c/p\u003e\n\u003cp\u003eAES is a symmetric cryptography block cipher algorithm [4]. Rijndael is the name given to it. From AES key schedule method, the round keys comes from the secret key. AES also applies an XOR operation in every byte of the state in order to combine it with each byte of the round key, which is called as AddRoundKey. In a nonlinear substitution step known as SubBytes, A lookup table is used to replace each byte with another. The last three rows of state are shifted cyclically a few number of steps in a transposition step called as ShiftRows. MixColumns performs a linear mixing operation on the state\u0026apos;s columns to combine the four bytes in each column. AES delivers every round with four steps:\u003c/p\u003e\n\u003cul\u003e\n \u003cli\u003eStep1.SubBytes,\u0026nbsp;\u003c/li\u003e\n \u003cli\u003eStep2.ShiftRows,\u003c/li\u003e\n \u003cli\u003eStep3.MixColumns, and\u0026nbsp;\u003c/li\u003e\n \u003cli\u003eStep14. AddRoundKey\u003c/li\u003e\n\u003c/ul\u003e\n\u003cp\u003eDiffie-Hellman\u0026nbsp;Cryptography\u003c/p\u003e\n\u003cp\u003eThe Diffie-Hellman key exchange algorithm is shown in Table 1. Over the public channel, sender and receiver both share two prime numbers i.e., P and g, at first.\u003c/p\u003e\n\u003cp\u003eTABLE 1 Diffie-Hellman Key Exchange Protocol to generate three secret key\u0026nbsp;\u003c/p\u003e\n\u003ctable border=\"1\" cellspacing=\"0\" cellpadding=\"0\"\u003e\n \u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd valign=\"top\" style=\"width: 35.2761%;\"\u003eSender \u003cem\u003eA\u003c/em\u003e\u003c/td\u003e\n \u003ctd valign=\"top\" style=\"width: 29.4479%;\"\u003eAttacker \u003cem\u003eE\u003c/em\u003e\u003c/td\u003e\n \u003ctd valign=\"top\" style=\"width: 35.2761%;\"\u003eReceiver \u003cem\u003eB\u003c/em\u003e\u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd valign=\"top\" style=\"width: 35.2761%;\"\u003e\u003cem\u003eP\u003c/em\u003e\u003c/td\u003e\n \u003ctd valign=\"top\" style=\"width: 29.4479%;\"\u003e\u003cem\u003eP\u003c/em\u003e\u003c/td\u003e\n \u003ctd valign=\"top\" style=\"width: 35.2761%;\"\u003e\u003cem\u003eP\u003c/em\u003e\u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd valign=\"top\" style=\"width: 35.2761%;\"\u003e\u003cem\u003eg\u003c/em\u003e\u003c/td\u003e\n \u003ctd valign=\"top\" style=\"width: 29.4479%;\"\u003e\u003cem\u003eG\u003c/em\u003e\u003c/td\u003e\n \u003ctd valign=\"top\" style=\"width: 35.2761%;\"\u003e\u003cem\u003eG\u003c/em\u003e\u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd valign=\"top\" style=\"width: 35.2761%;\"\u003e\u003cem\u003ea\u003c/em\u003e\u003c/td\u003e\n \u003ctd valign=\"top\" style=\"width: 29.4479%;\"\u003e\u0026nbsp;\u003c/td\u003e\n \u003ctd valign=\"top\" style=\"width: 35.2761%;\"\u003e\u003cem\u003eB\u003c/em\u003e\u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd valign=\"top\" style=\"width: 35.2761%;\"\u003e\u003cem\u003eA\u0026nbsp;\u003c/em\u003e= \u003cem\u003eg\u003c/em\u003e\u003cem\u003ea\u0026nbsp;\u003c/em\u003e\u003cem\u003emod\u0026nbsp;P\u003c/em\u003e\u003c/td\u003e\n \u003ctd valign=\"top\" style=\"width: 29.4479%;\"\u003e\u0026nbsp;\u003c/td\u003e\n \u003ctd valign=\"top\" style=\"width: 35.2761%;\"\u003e\u003cem\u003eB\u0026nbsp;\u003c/em\u003e= \u003cem\u003eg\u003c/em\u003e\u003cem\u003eb\u0026nbsp;\u003c/em\u003e\u003cem\u003emod\u0026nbsp;P\u003c/em\u003e\u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd valign=\"top\" style=\"width: 35.2761%;\"\u003e\u003cem\u003eB\u003c/em\u003e\u003c/td\u003e\n \u003ctd valign=\"top\" style=\"width: 29.4479%;\"\u003e\u003cem\u003eA\u003c/em\u003e, \u003cem\u003eB\u003c/em\u003e\u003c/td\u003e\n \u003ctd valign=\"top\" style=\"width: 35.2761%;\"\u003e\u003cem\u003eA\u003c/em\u003e\u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd valign=\"top\" style=\"width: 35.2761%;\"\u003e\u003cem\u003eSK\u0026nbsp;\u003c/em\u003e= \u003cem\u003eB\u003c/em\u003e\u003cem\u003ea\u0026nbsp;\u003c/em\u003e\u003cem\u003emod\u0026nbsp;P\u003c/em\u003e\u003c/td\u003e\n \u003ctd valign=\"top\" style=\"width: 29.4479%;\"\u003e\u0026nbsp;\u003c/td\u003e\n \u003ctd valign=\"top\" style=\"width: 35.2761%;\"\u003e\u003cem\u003eSK\u0026nbsp;\u003c/em\u003e= \u003cem\u003eA\u003c/em\u003e\u003cem\u003eb\u0026nbsp;\u003c/em\u003e\u003cem\u003emod\u0026nbsp;P\u003c/em\u003e\u003c/td\u003e\n \u003c/tr\u003e\n \u003c/tbody\u003e\n\u003c/table\u003e\n\u003cp\u003e\u003cbr\u003e\u003c/p\u003e\n\u003cp\u003eUsing a true-random number generator, it generates A and B as \u0026nbsp;two random key i.e., a and b, respectively. The keys a and b are both kept hidden. A = g\u003csup\u003ea\u003c/sup\u003e mod P is computed by the A, and the A is sent to B. In the same way, the B calculates B = g\u003csup\u003eb\u003c/sup\u003e mod P and sends it to A. The shared secret keys SK = B\u003csup\u003ea\u003c/sup\u003e mod P and SK = A\u003csup\u003eb\u003c/sup\u003e mod P can be computed by the A and B, respectively. [5]\u003c/p\u003e\n\u003cp\u003e\u003cstrong\u003eHuffman\u0026nbsp;coding\u003c/strong\u003e\u003c/p\u003e\n\u003cp\u003eHuffman Coding\u0026nbsp;is employed in lossless data compression. It applies variable-size method for encoding. It denotes all characters with variable size code. The smallest code is assigned to the most frequently appearing character. The highest code is assigned to the character who appears the fewest times. A rule known as a prefix rule is used in Huffman coding. This is done to prevent ambiguity during decoding. It ensures that no character\u0026apos;s code is a prefix of any other character\u0026apos;s code[8].\u003c/p\u003e\n\u003cp\u003eHuffman Coding Procedures\u003c/p\u003e\n\u003cp\u003e\u0026bull; Using the input character to create a Huffman Tree.\u003c/p\u003e\n\u003cp\u003e\u0026bull; Using the Huffman tree to assign code to the characters.\u003c/p\u003e\n\u003cp\u003e\u003cstrong\u003eBlock Diagram of proposed Work\u003c/strong\u003e\u003c/p\u003e\n\u003cp\u003eThe Huffman encoding algorithm protects the Diffie-Hellman algorithm from an attacker. As a result, Encoded-DH is resistant to attackers and can compute a shared secure secret key. There are several steps in the encryption process. First, a random number N is entered. Following that, the plaintext is encrypted using the enhanced Diffie-Hellman key exchange algorithm. Implement the Huffman encoding algorithm to increase security by encrypting and compressing encrypted data. After that, AES encryption is used to encrypt the compressed data and provide connection authentication.\u003c/p\u003e\n\u003cp\u003e\u003cstrong\u003ePseudo code\u003c/strong\u003e\u003c/p\u003e\n\u003cp\u003eGenerate random data ( 0 to 255) i.e. message m\u003c/p\u003e\n\u003cp\u003eGenerate key using \u003cstrong\u003eDiffie\u0026nbsp;Hellman\u0026nbsp;Key\u0026nbsp;Exchange\u003c/strong\u003e\u003c/p\u003e\n\u003cp\u003ePerform\u0026nbsp;XOR\u0026nbsp;operation\u0026nbsp;on\u0026nbsp;message\u0026nbsp;with\u0026nbsp;key\u0026nbsp;and generate cipher data\u003c/p\u003e\n\u003cp\u003eApply\u0026nbsp;compression\u0026nbsp;on\u0026nbsp;cipher\u0026nbsp;data\u0026nbsp;using\u0026nbsp;Huffman encoding\u003c/p\u003e\n\u003cp\u003eNow\u0026nbsp;Apply\u0026nbsp;AES\u0026nbsp;encryption\u0026nbsp;algorithm\u003c/p\u003e\n\u003cp\u003eS=C\u0026nbsp;is\u0026nbsp;compress\u0026nbsp;data\u003c/p\u003e\n\u003cp\u003eAddRoundKey(state,\u0026nbsp;\u0026amp;X[0])\u003c/p\u003e\n\u003cp\u003efor i=1 step 1 to 9\u003c/p\u003e\n\u003cp\u003eSubBytes(S)\u003c/p\u003e\n\u003cp\u003eShifRows(S)\u003c/p\u003e\n\u003cp\u003eMixColumns(S)\u003c/p\u003e\n\u003cp\u003eAddRoundKey(S, \u0026amp;X[i]*4)\u003c/p\u003e\n\u003cp\u003eend\u0026nbsp;for\u003c/p\u003e\n\u003cp\u003eSubBytes(S)\u003c/p\u003e\n\u003cp\u003eShift\u0026nbsp;Rows(S)\u003c/p\u003e\n\u003cp\u003eAddRoundKey(S,\u0026nbsp;\u0026amp;X[40])\u003c/p\u003e\n\u003cp\u003eData Encrypted\u003c/p\u003e"},{"header":"4. Results","content":"\u003cp\u003eThis table compares three encryption algorithms\u0026mdash;AES, RSA, and a proposed algorithm\u0026mdash;across several parameters: key size, storage requirements, encryption time, decryption time, and total processing time.\u003c/p\u003e\n\u003col\u003e\n \u003cli\u003e\u003cstrong\u003eType of Algorithm\u003c/strong\u003e: Three algorithms are listed\u0026mdash;AES (Advanced Encryption Standard), RSA (Rivest-Shamir-Adleman), and the \u0026quot;Proposed\u0026quot; algorithm.\u003c/li\u003e\n \u003cli\u003e\u003cstrong\u003eKey Size\u003c/strong\u003e: AES uses a 128-bit key, RSA uses a 1024-bit key, and the proposed algorithm uses a 16-character string, equivalent to a 128-bit key.\u003c/li\u003e\n \u003cli\u003e\u003cstrong\u003eStorage\u003c/strong\u003e: Both AES and RSA require more storage space, whereas the proposed algorithm requires less, which can make it more efficient for storage-constrained environments.\u003c/li\u003e\n \u003cli\u003e\u003cstrong\u003eEncryption Time\u003c/strong\u003e: AES has an encryption time of 0.011895 seconds, RSA has a much longer encryption time at 0.50241 seconds, while the proposed algorithm\u0026rsquo;s encryption time is 0.015577 seconds, which is slightly longer than AES but significantly faster than RSA.\u003c/li\u003e\n \u003cli\u003e\u003cstrong\u003eDecryption Time\u003c/strong\u003e: AES decryption takes 0.002815 seconds, RSA takes 0.6844 seconds (the longest of the three), and the proposed algorithm\u0026rsquo;s decryption time is 0.01568 seconds, slightly higher than AES but again faster than RSA.\u003c/li\u003e\n \u003cli\u003e\u003cstrong\u003eTotal Processing Time\u003c/strong\u003e: This is the sum of encryption and decryption times. AES has a total processing time of 0.12176 seconds, RSA takes the longest with 1.1868 seconds, and the proposed algorithm has the shortest total time at 0.031257 seconds.\u003c/li\u003e\n\u003c/ol\u003e\n\u003cp\u003e\u003cstrong\u003eTable2:\u0026nbsp;\u003c/strong\u003e\u003cstrong\u003eComparison of Results with AES,RSA and Proposed Algorithms\u003c/strong\u003e\u003c/p\u003e\n\u003ctable border=\"1\" cellspacing=\"0\" cellpadding=\"0\" width=\"614\"\u003e\n \u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd valign=\"top\" style=\"width: 16.9381%;\"\u003e\n \u003cp\u003e\u003cstrong\u003eType of Algorithm\u003c/strong\u003e\u003c/p\u003e\n \u003c/td\u003e\n \u003ctd valign=\"top\" style=\"width: 18.4039%;\"\u003e\n \u003cp\u003e\u003cstrong\u003eKey Size\u0026nbsp;\u003c/strong\u003e\u003c/p\u003e\n \u003c/td\u003e\n \u003ctd valign=\"top\" style=\"width: 10.7492%;\"\u003e\n \u003cp\u003e\u003cstrong\u003eStorage\u0026nbsp;\u003c/strong\u003e\u003c/p\u003e\n \u003c/td\u003e\n \u003ctd valign=\"top\" style=\"width: 16.9381%;\"\u003e\n \u003cp\u003e\u003cstrong\u003eEncryption Time\u0026nbsp;\u003c/strong\u003e\u003c/p\u003e\n \u003c/td\u003e\n \u003ctd valign=\"top\" style=\"width: 16.9381%;\"\u003e\n \u003cp\u003e\u003cstrong\u003eDecryption Time\u0026nbsp;\u003c/strong\u003e\u003c/p\u003e\n \u003c/td\u003e\n \u003ctd valign=\"top\" style=\"width: 20.0326%;\"\u003e\n \u003cp\u003e\u003cstrong\u003eTotal Processing Time\u0026nbsp;\u003c/strong\u003e\u003c/p\u003e\n \u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd valign=\"top\" style=\"width: 16.9381%;\"\u003e\n \u003cp\u003eAES\u0026nbsp;\u003c/p\u003e\n \u003c/td\u003e\n \u003ctd valign=\"top\" style=\"width: 18.4039%;\"\u003e\n \u003cp\u003e128 bits\u0026nbsp;\u003c/p\u003e\n \u003c/td\u003e\n \u003ctd valign=\"top\" style=\"width: 10.7492%;\"\u003e\n \u003cp\u003eMore\u0026nbsp;\u003c/p\u003e\n \u003c/td\u003e\n \u003ctd valign=\"top\" style=\"width: 16.9381%;\"\u003e\n \u003cp\u003e0.011895\u0026nbsp;\u003c/p\u003e\n \u003c/td\u003e\n \u003ctd valign=\"top\" style=\"width: 16.9381%;\"\u003e\n \u003cp\u003e0.002815\u0026nbsp;\u003c/p\u003e\n \u003c/td\u003e\n \u003ctd valign=\"top\" style=\"width: 20.0326%;\"\u003e\n \u003cp\u003e0.12176\u0026nbsp;\u003c/p\u003e\n \u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd valign=\"top\" style=\"width: 16.9381%;\"\u003e\n \u003cp\u003eRSA\u0026nbsp;\u003c/p\u003e\n \u003c/td\u003e\n \u003ctd valign=\"top\" style=\"width: 18.4039%;\"\u003e\n \u003cp\u003e1024 bits\u0026nbsp;\u003c/p\u003e\n \u003c/td\u003e\n \u003ctd valign=\"top\" style=\"width: 10.7492%;\"\u003e\n \u003cp\u003eMore\u0026nbsp;\u003c/p\u003e\n \u003c/td\u003e\n \u003ctd valign=\"top\" style=\"width: 16.9381%;\"\u003e\n \u003cp\u003e0.50241\u0026nbsp;\u003c/p\u003e\n \u003c/td\u003e\n \u003ctd valign=\"top\" style=\"width: 16.9381%;\"\u003e\n \u003cp\u003e0.6844\u0026nbsp;\u003c/p\u003e\n \u003c/td\u003e\n \u003ctd valign=\"top\" style=\"width: 20.0326%;\"\u003e\n \u003cp\u003e1.1868\u0026nbsp;\u003c/p\u003e\n \u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd valign=\"top\" style=\"width: 16.9381%;\"\u003e\n \u003cp\u003eProposed\u0026nbsp;\u003c/p\u003e\n \u003c/td\u003e\n \u003ctd valign=\"top\" style=\"width: 18.4039%;\"\u003e\n \u003cp\u003e16character string(128 bits)\u0026nbsp;\u003c/p\u003e\n \u003c/td\u003e\n \u003ctd valign=\"top\" style=\"width: 10.7492%;\"\u003e\n \u003cp\u003eLess\u0026nbsp;\u003c/p\u003e\n \u003c/td\u003e\n \u003ctd valign=\"top\" style=\"width: 16.9381%;\"\u003e\n \u003cp\u003e0.015577\u0026nbsp;\u003c/p\u003e\n \u003c/td\u003e\n \u003ctd valign=\"top\" style=\"width: 16.9381%;\"\u003e\n \u003cp\u003e0.01568\u0026nbsp;\u003c/p\u003e\n \u003c/td\u003e\n \u003ctd valign=\"top\" style=\"width: 20.0326%;\"\u003e\n \u003cp\u003e0.031257\u0026nbsp;\u003c/p\u003e\n \u003c/td\u003e\n \u003c/tr\u003e\n \u003c/tbody\u003e\n\u003c/table\u003e\n\u003cp\u003e\u003cbr\u003e\u003c/p\u003e\n\u003cp\u003eIn summary, the proposed algorithm demonstrates better efficiency in terms of storage and processing time compared to both AES and RSA, making it potentially more suitable for secure data transmission and storage, especially in environments where storage and speed are critical.\u003c/p\u003e"},{"header":"5. Conclusion","content":"\u003cp\u003eThe proposed problem is primarily related to data security in a cloud environment. In the solution compression and cryptography techniques are combined to increase the level of data security. The encoded-DHA algorithm, derived from the conventional Diffie-Hellman algorithm and AES, has been proposed in this paper. In the insecure channel, the traditional Diffie-Hellman algorithm shares the numbers publicly, thats why attacks on the Diffie-Hellman algorithm, such as Logjam, are possible. As a result, this paper proposes Encoded-DHA with AES as a solution to the security problem. The proposed methodology ensures data security while also compressing it. There is no communication overhead with encoded-DHA. Encoded-DHA also demonstrates its high resistance to attacks. Encoded-DH can provide a high level of security.\u003c/p\u003e"},{"header":"References","content":"\u003col\u003e\n\u003cli\u003ePratibha Tripathi, Mohammad Suaib “Security Issues On Cloud Computing ” International Journal Of Engineering Technology, Management And Applied Sciences November 2014, Volume 2 Issue 6, ISSN 2349-4476.\u003c/li\u003e\n\u003cli\u003eHarshavardhankayarkar, Sugata Sanyal “A Survey On Various Data Hiding Techniques And Their Comparative Analysis” M.G.M‟S College Of Engineering And Technology, Navi Mumbai, India Sugata Sanyal School Of Technology And Computer Science, Tata Institute Of Fundamental Research, Mumbai, India.\u003c/li\u003e\n\u003cli\u003eR Shanthakumari and S Malliga” Dual-Layer Security Of Image Steganography Based On IDEA And LSBG Algorithm In The Cloud Environment” Indian Academy Of Sciences Received 23 August 2018; Revised 20 February 2019; Accepted 11 March 2019; Published Online 20 April 2019.\u003c/li\u003e\n\u003cli\u003eDr. Kiramatullah, Bibi Ayisha, Farrukh Irfan, Inaamillahi, Zeeshan Tahir “Comparison Of Various Encryption Algorithms For Securing Data” Pakistan Institute Of Engineering And Applied Sciences (PIEAS).\u003c/li\u003e\n\u003cli\u003eRavi, Dr. A. Ashokkumar “A Study Ofvarious Data Compression Techniques” International Journal Of Computer Science \u0026amp; Communication Volume 6,Issue 2 April –September 2015.\u003c/li\u003e\n\u003cli\u003eAparna G. Korde “ A Solution To Cloud Security : Image Steganography “ Epitome journals International Journal Of Multidisciplinary Vol. 2, Issue 2, February 2016, ISSN: 2395-6968.\u003c/li\u003e\n\u003cli\u003eMustafa Sabah Taha1,3, Mohdshafrymohd Rahim1,2, Sameer Abdulsattar Lafta4, Mohammed mahdihashim1,5,Hassanainmahdialzuabidi6 “Combination of Steganography and Cryptography: A Shor Survey” IOP Conference Series: Materials Science And Engineering.\u003c/li\u003e\n\u003cli\u003eP. Yellammadr. Narasimhamchalla “Performance Analysis Of Different Data Compression Techniques On Text File” International Journal Of Engineering Research \u0026amp; Technology (IJERT) Vol. 1 Issue 8, October –2012 ISSN: 2278-0181\u003c/li\u003e\n\u003cli\u003eHamza Tariq Khan, Heebah Saleem,” Improved Image Steganography Algorithm Using Huffman Codes” International Journal Of Computer Applications (0975 –8887) Volume 147 – No.12, August 2016\u003c/li\u003e\n\u003cli\u003eBharat Sinha ”Comparison Of PNG \u0026amp; JPEG Format For LSB Steganography” International Journal Of Science And Research (IJSR), Volume 4 Issue 4, April 2015, ISSN (Online): 2319-7064.\u003c/li\u003e\n\u003cli\u003eSujay Narayana1and Gaurav Prasad “Two New Approaches For Secured Image steganography Using Cryptographic techniques And Type Conversions”, Signal \u0026amp; Image Processing : An International Journal(SIPIJ) Vol.1, No.2, December 2010.\u003c/li\u003e\n\u003cli\u003eMonica Adriana Dagadita, Emilioanslus¸ Anschi, Razvandobre,” Data Hiding Using Steganography”, Conference Paper · June 2013\u003c/li\u003e\n\u003cli\u003eMr. Jayesh Surana, Aniruddhsonsale, Bhavesh Joshi, Deepesh Sharma, Nilesh Choudhary,” Steganography Techniques” , International Journal Of Engineering Development And Research, 2017 IJEDR | Volume 5.\u003c/li\u003e\n\u003cli\u003eMohammed Sabri Abuali, C.B.M. Rashidi, Muataz H. Salih, R. A. A. Raof,Safa Saad Hussein. In This Paper The Author,” Digital Image Steganography In Spatial Domain Comprehensive Review”, Journal Of Theoretical And Applied Information Technology15th October 2019. Vol.97. No 19.\u003c/li\u003e\n\u003c/ol\u003e"}],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":true,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":true,"hideJournal":true,"highlight":"","institution":"RIMT","isAcceptedByJournal":false,"isAuthorSuppliedPdf":false,"isDeskRejected":"","isHiddenFromSearch":false,"isInQc":false,"isInWorkflow":false,"isPdf":false,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"[email protected]","identity":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true},"keywords":"Cryptography, Diffie-Hellman, AES Encryption, Huffman Encoding Method","lastPublishedDoi":"10.21203/rs.3.rs-5454587/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-5454587/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"\u003cp\u003eAs cloud technology continues to grow at a rapid pace, it offers substantial advantages to the IT sector, including scalability, cost savings, and ease of access. However, protecting data stored in the cloud remains a critical challenge, with increasing vulnerabilities to unauthorized access and cyber threats. This paper presents a comprehensive method for enhancing cloud security by integrating encryption and compression techniques. The proposed approach begins by encrypting data through the Diffie-Hellman key exchange, followed by compression and encoding with Huffman coding to reduce data size while strengthening security. A second layer of encryption is then applied using the AES algorithm, resulting in a dual-encryption framework that enhances both protection and storage efficiency. The primary goal of this research is to deliver a secure, efficient solution for safeguarding cloud data in a resource-conscious manner.\u003c/p\u003e","manuscriptTitle":"Performance-Driven Encryption for Cloud Data Transmission and Storage Security","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2024-11-15 06:48:11","doi":"10.21203/rs.3.rs-5454587/v1","editorialEvents":[{"type":"communityComments","content":0}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true}}],"origin":"","ownerIdentity":"897c2d3e-b85a-4c53-8fe3-63023b12dc29","owner":[],"postedDate":"November 15th, 2024","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"posted","subjectAreas":[{"id":40276735,"name":"Computer Architecture and Engineering"}],"tags":[],"updatedAt":"2024-11-15T06:48:11+00:00","versionOfRecord":[],"versionCreatedAt":"2024-11-15 06:48:11","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-5454587","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-5454587","identity":"rs-5454587","version":["v1"]},"buildId":"qtupq5eGEP_6zYnWcrvyt","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}