Stenography & Cryptographic Hybridization

ABSTRACT

The quick advancement of computerized information trade has constrained data security to be of much significance in information stockpiling Furthermore, creating a transmission. As a huge measure of information is sent over the organization, it is fundamental to get a wide range of information previously sent. The current trend is AES; nevertheless, AES, the most frequently used encryption, has the disadvantage of employing several direct multi-variation conditions. Hence it very well may be broken utilizing mathematical cryptanalysis. Because AES was once considered to be fairly powerful, it was employed in a variety of encryption schemes, posing a serious threat. This paper discusses the architecture and deployment of a 128-digit key crossbreed-based AES and DES computation as a security upgrade, as well as the usage of stenography-based encryption to increase the security of the data provided and make it more difficult to crack.

Keywords- DES, AES, Stenography, Cryptography, Cross Breed Cipher

1. INTRODUCTION

The gold standard in cryptography. The technique is designed to decode and understand information squares made up of 64 components that are leveled from a 64-digit key. The Advanced Encryption Standard (AES) is a cryptographic standard having a 128-cycle block size having code length of 128, 192, and 256 bits, figuratively. Text, image, sound, and video input modalities are more secure when AES and DES are used together. The study identifies possible flaws in the existing AES encryption method, notably in the context of logarithmic-based cryptanalysis. Combining AES with DES is recommended for a better understanding of the need to limit logarithmic attacks on AES. As a result, work on the Half breed AES-DES computation has been made. Inducing the beauty of Stenography in this hybrid cipher algorithm has brought in an additional layer of security over to the data. With this newly enacted method, we can achieve more deadlock secure encryption to make sure the data gets transferred to the receiver from the sender without any discrepancies.

DATA ENCRYPTION STANDARD (DES)

The Data Encryption Standard (DES) is a square code computation that uses a series of complex methods to convert a fixed-length line of plaintext bits into another code text bit line of equal length. The square size is 64 pieces due to DES. DES also includes a key that may be used to reverse the change, allowing the key to be decoded by the same client that encoded it. Even though the key includes 64 components, only 56 are used in the computation. Before being removed, eight pieces are utilized to check for equality. As a result, even though this is rarely stated, the persuasive key length is 56 pieces. The chosen key’s eighth component is removed, leaving just the 56-bit key, which corresponds to locations 8, 16, 24, 32, 40, 48, 56, 64 of the 64 cycle key. The F-work is broken into four sections, each of which works on a large square (32 pieces) at a time:

1. Development — The 32-cycle half-block is stretched to forty eight pieces making use of the extension step by duplicating half of the data bit. The output is made up of eight 6-bit pieces, each comprising a replica of 4 associated input bits, in addition to some kind of clone of the next neighboring bit for all the information segments on each part.
2. Key blending — The outcome is mixed onto a subkey with the help of a XOR action. 16–48-piece sub keys one on each round are produced with the help of the parent key and making use of the key schedule.
3. Replacement — After combining in the subkey, the square was split into eight 6-cycle parts prior to processing by having S-boxes, or replacement boxes. From the 8 S-boxes, each one changes it’s 6 info bits taking help of the 4 output bits as shown by a non-direct modification, provided, being a querying table. S-boxes provide the core of the protection of DES; in the absence of these, the code would be straightforward, and incomprehensibly breakable.
4. Change — Finally, the thirty two outputs from the S-boxes were modified by a defined adjustment, the P-box. It is designed such that, after advancement, each S-yield box’s pieces are distributed among 6 different S encloses in the next round. DES — The 16 Turns The important connection in encoding a 64 digit part of the initiative; having the 56-bit code, and utilising the DES comprises the follows:

• An Initial Permutation (IP)
• Sixteen iterations of a mind-boggling code word calculation
• The final modification is the inversion of the IP

Pictorials of the mathematical concepts behind the DES algorithm -

Final Permutation

1.2 ADVANCED ENCRYPTION STANDARD (AES)

AES relies on a design rule known as a Replacement stage organization. Unlike its progenitors, DES and AES don’t use a Feistel structure. AES does have a set structure of 128 pieces as well as a critical dimension of 128, 192, or 256 pieces, whereas Rijndael may be specified using block additionally, key lengths in either of 32 pieces or at least 128 pieces. The square dimension has an upper length of 256 bits. AES works as a 4×4 section significant demand lattice containing bits, this is called a state version of the well known Rijndael having larger square dimensions, including proprietary sections within data. The majority of AES computations are performed in a single, constrained field. The AES estimate is generated as different variations of alteration adjustments that transform raw un-encrypted data into the final product of code text. Each cycle includes several handling stages, one of which depends upon the secret keys. A lot of converse cycles are performed to convert figure data into the original text, once again, by utilizing a comparable private key. The block length of an AES form shows the total quantity of rounds of change adjustments that transform the information raw content into the finished output, known as the code text. The following are the number of reiteration patterns:

• Reiteration patterns for 128-bit codes.
• Redundancy patterns for 192-piece codes.
• Redundancy patterns for 256-bit codes.

In Rijndael, a byte is the basic information component across all code operations. These sequences are decoded as limited area components using polynomial depiction, with a character b having bits b0, b1,… b7 addressing limited scope components. For essential planning and modifying, limited scope activities such as expansion and growth are required. The expansion of two restricted field components is done by combining the factors for comparing strengths in their mathematical representations, with this expansion occurring within GF(2), such that, modulo 2, such that 1+ 1 = 0. the line. The subsequent line is shifted to one side, the third line moved multiple times and the fourth column moved three times.

Blend Columns: The blend sections alter the figures of a proposed state grid S by multiplying the current state grid S by some algebraic matrices on the left. Expansion is just XOR across 2 articulations. Limited scope duplication is much more difficult than expansion but is accomplished simply by duplicating the algebraic equations and taking the remainder as its result. Because there are 256 potential factors, a search in the database for a range of operational generators is possible. As a result, the query record has 256 × 256 parts.

Planning: The round codes are Nc formulations of important information that are required for every iteration. Key planning with 256-bit keys is naturally based on squares of four 32-bit words. Calculating one fresh round code as from the previous iteration involves computing its ith expression of such original round code using K[i], where 0i 4 is also the ith expression of a subsequent round code to P[i]. P[0] is processed via a Bitwise involving P[0], a steady r, with P[3] both of which are already rotated & modified. P[i] = P[i]*P[i-1] determines the latter 3 words, P[1], P[2], and P[3].

Adjusting: The code input is copied into the inner value just at the start of the code using previously shown techniques. The value is therefore altered by stressing a round task in different cycles after an underlying rounded variable is introduced. It’s the calculation proposed by Rijndael.

Round Function: Each iteration is referred to as a loop, and each loop includes 4 phases. Every stage with change can be seen underneath.

Round Key Addition: It’s the opening move toward change. The Bitwise Round code capability, pronounced as must perform a xor of an info lattice as well as the round code grid.

Sub-Bytes: Transformation: The inversion of the condition grid is discovered in this, and a fine modification is made.

Shift Rows: A Shift Row change works independently from each of the next 3 sections of the grid system whilst consistently moving the bits of data within Advanced Encryption Standard (AES) seems to be a square code that has been confirmed also as norm by the NIST, has been chosen utilizing a cycle that is particularly extra accessible and straightforward than an archetype, the maturing DES. The interaction was praised by the accessible cryptographical local area, assisted with expanding certainty in the security of the triumphant calculation from the individuals who were dubious of indirect accesses in the archetype, DES.

The math involved isn’t too complicated; it contains a polynomial notation, a binary notation, and a hexadecimal notation. With an array of input bytes, state array, and finally, the output bytes.

1.3 CROSS BREED CIPHERS

A cross breed cryptography combines at least 2 cryptography systems. It combines asymmetrical and synchronous cryptography to benefit from the advantages of each cryptography. The terms “speed” and “security” are used to describe these aspects individually.

Cross breed encryption is thought to be a very safe kind of cryptography provided the secret keys are fully secure.

A cross breed cryptography plan combines the convenience of a topsy-turvy cryptography system also with the feasibility of a block cipher scheme.

Cross breed cryptography is achieved via data transfer using meeting credentials in conjunction with balanced cryptography. For erratic symmetric cryptography, the encryption key is used. At a certain moment, the beneficiary uses the cryptography method to decrypt the ciphertext. After recovering the ciphertext, it’s utilized for decoding messages.

A combination of cryptographic techniques has a variety of advantages. The first is the establishment of an affiliation connection among two client hardware configurations. Users may then communicate via cross-breed encryption. Unbalanced cryptography may impede cryptography interaction; nevertheless, when cryptography is used concurrently, the two kinds of encryption are improved. As a result, the communication interaction is more secure, and the application’s performance is generally improved.

1.4 IMAGE STEGANOGRAPHY

Picture Cryptology relates to the procedure of concealing data within a photographic file. This image selected in this design gets referred to as the profile photo, and the image obtained after the algorithm is referred to as the stego image.

An image is handled in memory as an A*B as in the case of greyscale images or A*B*3 as in the case of shading images grid, for each segment addressing the energy worth of just a unit. The text is implanted inside an image using picture steganography by altering the upsides of some bits chosen via an encrypt calculation. The recipient of the image should be aware of an identical computation in order to determine what pixels must be used to split the information.

The cycle of steganography completes the placement of the information within the main image. This will be accomplished by inspecting the image, calculating graphs, or determining the location of commotion. While efforts are already being directed toward developing new computations with a higher degree of resilience to such attacks, efforts are also being directed toward improving current computations for steganography, which is used to identify the trading of protected information between scaremongers or lawbreaker parts.

The working of the LSB algorithm for image steganography is quite simple.

In this structure to the dismissal of all the other things we need to change over the picture pixel to Binary ascribes by Crisscross scan by girth=R*S*8, R refers to the proportion lines embedded inside the image and S refers to check off areas and the amount of bits for every pixel is eight. At the finale to triumph when it’s all said and done the last two pieces of each pixel where LSB position is 0 and spot before the LSB is 1. While doing this technique, in the interim proselyte the question message(which you need to stow away) into composed characteristics with size identical to1*N where N is included in the secret message. Happening to change over the picture pixels and mystery message, straightforwardly we will energize the secret message two crease bits with the two pieces of LSB. There are 3 stages in this process[5].

1. If the classified message bit approaches with ―0‖th position of the LSB, then, at that point the key worth will be “0”.

2. In this cycle, if the classified message bit rises to with position ―1‖ of the LSB, then, at that point the key worth will be “1”.

3. In this cycle, if the classified message bit doesn’t rise to with both position 1 of LSB and position 0 of LSB, by then, at that point the key worth will be “0”.

After this system, we will get the key. This key will be the stego key among the messenger and beneficiary. Without having this stego-key, the beneficiary will not have the option to decipher the classified information. This stego-key will propose the Position of puzzle information in the stego-picture. This stego-key is fundamental for this system. This key is called the Considering how the code will vary based on the picture, we will utilize a code for this in the same manner, the degree of the secret message. By taking this model we will show how the encryption and the decoding techniques are done. This key will be utilized for both encoding and deciphering measures.

1.5 CRYPTOGRAPHY

Cryptography is the use of numerical concepts as well as a collection of regulation computations known as estimations to alter communications in hard-to-decipher ways. These predictable computations are used for encryption keys generation, enhanced branding, validation to protect data privacy, online browsing, and confidential documents, such as Visa transactions and fax.

There are four main objectives for cryptography:

1. Secrecy: the data can’t be perceived by anybody for whom it was accidental
2. Respectability: The info cannot be altered or transferred between the transmitter and the anticipated receiver unless the change is identified.
3. Non Disavowal: creators/transmitters cannot afterward disclaim their motivations for creating or transmitting the data.
4. Validation: the transmitter and collector could confirm one another’s identity and the data’s beginning/objective

2. LITERATURE SURVEY AND RELATED WORK

Hybridization of cipher encryption techniques was mixed and matched previously, they were brought into the light by many other researchers. Some of the related works are mentioned below:

• Rosziati Ibrahim and Teoh Suk Kuan (2011) found a way to implement stenographic implementation to hide secret messages inside an image.
• Priyadarshini Patil, Prashant Narayankar (2019) found a comprehensive evaluation of cryptographic algorithms in the fields of DES, AES, 3DES, and RSA whilst including blowfish.
• Heera G. Wali, Nalini C. Iyer (2017) found a modified MASK algorithm for Image encryption.
• Ankush V. Dahat, Pallavi V. Chavan (2016) proposed a cryptographic scheme that can transform a secret image into any number of shares as per the user’s needs and provide more image security.
• Ankita Tondwalkar, Preetida Vinayakray-Jani (2016) found a security mechanism robust enough to sustain adversarial circumstances of different cover images used by the attacker node.
• Jyoti Tripathi, Anu Saini a, Kishan a, Nikhil a, Shazad (2020) suggested the fact that security of the scheme critically depends on a shared key and the sum of shares required for regeneration of the secret image.
• Garibha Swain (2016) presented two new steganography methods in the spatial domain. With the basic idea of substitution of a group of bits in a pixel by another group of bits of the same length to hide one or two bits of secret data.
• Sara Tedmori, Nijad Al-Najdawi (2018) proposed a Lossless Image Cryptography Algorithm Based on Discrete Cosine Transform.
• Nitin Jirwan, Sandip Vijay, Ajay Singh (2013) researched the review and analysis of cryptography techniques.
• Mahavir Jain, Arpit Agarwal (2014) researched on implementing Hybrid Cryptography Algorithms.
• Ako Muhammad Abdullah and Roza Hikmat Hama Aziz (2016) found out new ways to encrypt and decrypt data in images using cryptography and steganalysis algorithms were given.
• Sitesh Kumar Sinha (2013) suggested Improved Symmetric Key Cryptography Algorithm which Enhances Data Security.
• P.V.V. Kishore (2017) made an effective Medical Channel Coding Technique in E-Healthcare Applications Using Compression and Cryptography Algorithm Hybridization
• Mayes M. Hoobi (2020) suggested an efficient hybrid cryptographic algorithm.
• Rawya Rizk, Yasmin Alkady (2015) made a research on two-phase hybrid cryptography algorithm for wireless sensor networks.
• Aesha Elghandour, Ahmad Salah, Abdel Rahman Karawia (2021) brought up a new cryptographic algorithm via a two-dimensional chaotic map.
• Vinay Chamola, Alireza Jolfaeib, Vaibhav Chananac, Prakhar Parasharic, Vikas Hasija (2021) gathered a research team on threats to current encryption and post-quantum cryptography in the post-quantum epoch for 5G and even beyond networks.
• Jinu Mohan (2020) made research on enhancing home security through visual cryptography.
• Surinder Kaur (2017) had extensive research on the study of Multi-Level Cryptography Algorithms: Multi-Prime RSA and DES.
• Dhananjay Puglia, Harsh Chitral, Salpesh Lunawat, Durai Raj Vincent PM (2013) successfully made a research paper on an efficient encryption algorithm based on public-key cryptography.

3. ARCHITECTURE OF THE HALF BREED AES & DES

Our suggested calculation, the Hybrid AES-DES has the objective accomplished with the use of joining two calculations known as DES and AES.

Feistel’s work at IBM in the late 1960s and early 1970s gave birth to modern encryption. In 1977, the National Institute of Standards and Technology (NIST) adopted DES for encrypting unclassified data.

The Advanced Encryption Standard (AES), a new standard, has taken the role of DES.

DES is linked to several difficulties. The following are a few of them:

i. The biggest flaw in DES is the key size of 56 bits. Some processors can do 1 million data encryption standards to encode and decode iterations,

ii. On hardware, DES applications are very efficient; DES wasn’t designed for software and so operates poorly.

iii. Brute force, a known-plain-text method that necessitates the testing of 255 keys.

iv. Differential cryptanalysis seems to be the favored method, in which the hacker encrypts multiple bits of plain text and deduces a key from differences in the resultant text.

3.1 A comparison between DES and AES

A comparative table between the two algorithms will give us an insight into the performance analysis of the two algorithms:

3.2 For encryption of information:-

1. Initially, 128 digit text is divided into two groupings of 64 digits plain content information.

2. Following that, we use the 64 bit plain text as a contribution for the DES computation, that further scrambles to produce encoded 64 digit text.

3. Such two configurations of encoded 64 cycle writes are then converged as a single 128 bit scrambled information, that is used to calculate AES for more encoding.

4. Next this 128 bit encrypted text is used as an input for image steganography which gives an image embedded with this text as an output.

Fig. 1 — Encryption of information

3.3 For decryption of information:-

1. The image embedded with data is taken as input for the steganography decryption algorithm; it results in a 128-bit encrypted text as output.

2. The 128 bit scrambled information is applied to AES calculation, which gives an unscrambled set of 128 digits of information.

3. This one bunch of 128 digits of information is then further separated into two 64 digit informational indexes.

4. These informative collections are then used in conjunction with the DES computation to produce two unscrambled sets of 64 digits.

5. These two arrangements of 64 bit unscrambled information converge into single 128-bit information.

Fig. 2 — Decryption of information

4. PROPOSED MODEL AND ITS BACKGROUND DETAILS

4.1 PROBLEM SPHERE:

Even though we discussed the various problems, DES isn’t any longer safe for transmitting information throughout the business. With today’s better frameworks, it is simpler to crack the code of DES computation. We can crack the DES in 8 hours using 600 million guidelines per subsequent. Additionally, if we believe that the performance of PCs will continue to get better, it will be possible to break the AES computation as well. As a result, we suggest a framework of a mixture calculation that is a combination of DES and AES. As a result, the security of both computations would be strengthened by this hybrid framework.

4.2 SOLUTION SPHERE:

A computer network is a linked collection of self-governing figuring hubs that use unique, generally agreed-upon norms and indications identified as conventions that associate with one another seriously and enable asset exchange ideally in a predictable and controlled manner. Correspondence has a major impact on today’s company. This is desired for discussing sensitive information in a secure environment. Only with a fast chain of events of organizational innovation, online assaults are likewise adaptable; traditional encryption calculations (single data encryption) aren’t adequate for modern data privacy over the web, therefore we offer this cross breed Cryptography Algorithm. This is a strategy towards transferring data more securely. Currently, many types of cryptographic computations provide excellent protection to data on networking, although there are a few disadvantages. The whole mixing computation is designed to improve security by combining DES and AES.

1. IMPLEMENTATION OF THE MODEL AND RESULTS

Our framework may sound complicated from the methods involved above, but it’s actually quite viable and simple to implement. There are certain steps that are mentioned below to give an insight on implementing the framework that was planned.

5.1 STEPS FOR CROSS BREED ALGORITHM IMPLEMENTATION

DES takes a contribution of 64-digit plaintext information block and 56-bit key (with 8 pieces of equality) and yields a 64-digit figure text block.

1. The 8 equality pieces are eliminated from the key by exposing the way into its Key Permutation.

2. We have a sixteen round process in which the raw data and the code keys are processed:

The key is parted into two 28-bit parts.

1. Depending on the round, every half of both the code is shifted by either a slice or two.

2. The components are blended & rely on something like a Compression Permutation will reduce the code from fifty-six to forty-eight pieces. Each Compressed Code is then used to scramble the unencrypted block for the given cycle.

3. The critical essential components from stage two are used in the next one.

4. The data block is divided into 2 thirty two-cycle halves.

5. 50% is reliant around an Expanding Variation to grow to forty eight pieces.

6. The stage six yield is restrictive OR-ed mostly with stage three forty eight-piece compressed code.

7. The yield for stage seven is handled by an S-box that replaces crucial pieces thus reducing the forty eight-piece component to 32 bits.

8. The yield for stage eight was determined by the use of a P-box to commute the pieces.

9. Every output including its P-box is judiciously OR-ed only with the remainder of the block where information is procured.

10. There will be 2 information portions exchanged and the information for the next round.

3. The end result of Sixteen modifications is the figure message.

4. The associated code phrase would be an AES contribution.

The fifty-two 16-digit key sub-blocks that were created with the help of the 128-bit key can be delivered as follows:

i. To start with, we have a 128-cycle code, which is parceled onto 8 16-digit sub-blocks which are then straightforwardly utilized for the initial 8 code sub-blocks.

ii. The 128-bit code is then consistently moved from one side by twenty-five situations, furthermore, the resulting 128-bit block is further divided into 8 16-digit sub-squares to be straightforwardly utilized as the following 8 key sub-blocks.

iii. The shifting mechanism for cycles shown is also repeated until all 52 of the 16-bit set of sub have been generated.

5. To generate ciphertext, AES scores utilize the replacement or coupling of SP structure with several cycles. The number of iterations is determined by the size of the key. The key size is 128 pieces with 10 variations in cycle positions, and the key size is 192 elements with one of 12 levels and 258 levels. The key has 14 levels. However, since only one key is utilized in the computation, all of these rounds need the usage of a round key. This need should be expanded to also include the keys for every round, starting with round 0.

The steps are as follows:

i. Replacement of the bytes

The bytes of the square content are substituted in the first stage based on rules guided by preset S-boxes.

ii. Moving the lines

The next stage is to make a change. With the exception of the first column, all columns in this progression are shifted by a step.

iii. Blending the sections

The Hill figure is used in the third stage to further muddle the message by mixing the square’s parts.

iv. Including the round key

In the last step, the text is XOR-ed only with a unique round key. When used many times, these methods ensure that the final encrypted data is safe.

6. The AES — encrypted ciphertext is passed on to the stenography process where it’s embedded onto an image using the LSB algorithm of Image Steganography.

Thus, creating a triple layer security during the transmission of data has made the connection between sender and receiver more reliable and safe to transmit sensitive data during data communications.

5.2 MODEL IN ACTION

SENDER’S SIDE:

Input(as a text file):

DES Encrypted Text:

AES Encrypted Text (with DES Encrypted Text as Input):

AES Encrypted Text as Steganographic Input:

Image before the Encrypted Text is added:

Image after the Encrypted Text is added:

RECEIVER’S SIDE:

Decrypting the Encrypted Image:

Decrypting the Cipher Text (using AES):

Decrypting the Cipher Text (using DES):

5.3 PERFORMANCE ANALYSIS:

A further developed Hybrid AES-DES calculation as a method for fortifying the current AES engineering. The half breed model outperforms the simple AES in terms of nonlinearity and all things considered, converged with DES there is better dissemination thus the probability of a mathematical assault on the half breed model is diminished. Likewise, the time shown on the examination is the standard time since the time may change based on processor accessibility and processing power. As a consequence of the same, one cannot get a different time for the same contribution for encrypting and decoding. In a framework like this, applying distinctive calculations like DES, AES, and Cross breed AES-DES for text, method of info. In this calculation, if the key isn’t in a substantial organization, then a blunder report is produced. The key configuration is a mere 16 person key with 8, 4, 4 being the characters, numbers and uncommon characters respectively can be found for approval.

Table 5.3.1 Text length VS Time taken (for Encryption)

From the data, we can see that our hybrid cipher algorithm is performing not too bad with the encryption timing; considering the fact that it uses two algorithms at once. This has proven to improve the security of the transmission of data and making sure that we don’t sacrifice much in terms of run time for the particular program.

Having the perks of more security and not too bad of a hit on the run time has given us a reliable transmission for important and sensitive data.

This is relatively quick and has a constant but gradual increase in the time taken to encrypt / decrypt the data. Which by the hair is quite minimal in differences and has quite astonishingly has improvised the rate of perpetual data transmission over the network in a secured and contemptuous manner that is looked upon the likes of the standard DES and AES where the secure nature was not observed as proversively as in the case of the newly enacted hybrid format. Which gets better with the implementation of a steganographic context based algorithm in terms of the LSBs of the image pixels.

Table 5.3.2 Text length VS Time taken (for Decryption)

A similar scenario is viewed here, in this case, the decryption time is high; making it a proven fact that the hybrid algorithm makes a brilliant and secured algorithm, having increased the time of the decryption, making it harder for interpreting the data in foreign hands rather than getting it transmitted over to the receiver from the sender. Thus, proving the overall reliability of the system of transmission.

Table 5.3.3 Text length VS Time taken (for Steganographic Encryption & Decryption)

Now, moving over to the steganography side, we have two sets of data, one being the senders side and one from the receiver side. When the sender encrypts the data, it is found to take a larger amount of time for the progressively increasing order of the data transmission length. We can see that the encryption time is high whereas the decryption time increases over the course of action when the length in bits for the data meets a gradual upraise and surge in numbers.

5.4 HARDWARE AND SOFTWARE

This method may be developed in any language, including C, Ruby, Java, C++, and Python. This algorithm will be written in C and Python in this paper. It does not require any special hardware or software.

5.5 APPLICATIONS

Hundreds of security solutions are now accessible in a variety of market segments, financial services, media, and government are just a few examples. AES is the title of a tried-and-true, protected, and globally relevant technique of block encryption that protects transmitted and stored data from unauthorized third-party access. The greatest security requirements, as well as straightforward hardware and software implementation for fast execution, were the primary factors for the development of the Hybrid algorithm. Any encryption software can easily incorporate the Hybrid algorithm. To protect data transit and storage, data encryption can be utilized. Common fields include sound — visual content for satellite and television services, video conferencing, distance learning, commercial television, and VoIP. This Hybridized technique may be used in a variety of sectors.

Here’s a list of them:

i. Financial and business information that is highly sensitive.

ii. Using public networks to send emails.

iii. Modem, router, or ATM-based transmission lines, using GSM technology.

iv. Smart cards.

After encryption, the key is readily identified and retrieved. AES is a universally applicable proprietary block encryption method that successfully secures transmitted and stored data from unauthorized third-party access.

CONCLUSION

As a method of enhancing the current AES architecture, a hybrid DES-AES algorithm with image steganography has been developed. The hybrid model has better nonlinearity than the standard AES, this is because it’s integrated alongside DES, it has superior diffusion, reducing the chance of an algebra form of attack. Also, the times provided in the analysis are average times, as time can vary depending on processor availability and speed. Because of the same, one cannot receive various times for the same input for encryption and decryption. The algorithm will operate as an effective and trustworthy data encryption solution because it is a mix of two powerful encryption standards. A double key may also be used in the suggested method of strategy to protect itself from a linear form of cyber attacks, for the particular situation, the cipher algorithm’s security can be enhanced further. To enhance security, an irrational number is incorporated into DES, and the AES algorithm is embedded inside the DES framework. The text input mode is used in this system. Converting this model to binary and feeding it into the system, where encryption and decryption are applied.

6.1 FUTURE SCOPE

This suggested hybrid algorithm may be made substantially more powerful and safe by changing the number of loops in the encryption technique to match the level of security required. An opposite strategy of decreasing the number of turns may be employed for lower security. We can alternatively use another algorithm to encrypt the data provided by the AES algorithm. Although the inclusion of a 3rd algorithm would beef up security, a coin has two stages. As a consequence, privacy will increase, but the time ability to change plain text to final encrypted text will be greater than with the prior hybrid method. As a consequence, it is the requirement of an application in which you would use a security technique in which time or security will be the most important element. We must find a balance between the execution time of the solution and the level of security needed; both must be suitable.

7. ACKNOWLEDGEMENT

We are grateful to the professionals who contributed their research to the paper’s construction.

8. REFERENCES

1. Pratap Chandra Mandal, “Superiority of the Blowfish Algorithm”, International Journal of Advanced Research in Computer Science and Software Engineering, Volume 2, 2012.
2. Arvind Sharma, Mitali, Vijay Kumar, and Mitali “A Survey of Various Cryptography Techniques”, International Journal of Emerging Trends and Technology in Computer Science, Volume 3, 2014.
3. Daemen, J., and Rijmen, V. , “Rijndael: The Advanced Encryption Standard”, Dr. Dobb’s Journal, Volume 26, 2001.
4. L.Adleman, R.L.Rivest, A.Shamir, and R.L.Rivest, “A Method for Obtaining Digital Signatures and Public-Key Cryptosystems”, ACM Communication, Volume 21, №2, 1978.
5. Sunil k. Makar, Sombir Singh, and Dr. Sudesh Kumar, “Enhancing the Security of DES Algorithms Using Transposition Cryptography Techniques,” IJARCSSE, Volume 3, Issue 6, June 2013, pages 464–470.
6. Sean Murphy, and Matthew Robshaw, Department of Mathematics, Nick Hoffman, “A Simplified IDEA Algorithm.”, Northern Kentucky University, pages 1–5, 2007.
7. Shyam Nandan Kumar, “Technique for Security of Multimedia using Neural Network,” Paper id-IJRETM-2014–02–05–020, IJRETM, Vol: 02, Issue: 05, pp.1–7. Sep-2014
8. Aida Janadi; D. Anas, “AES Immunity Enhancement Against Algebraic Attacks Using Dynamic S-Boxes”, Information and Communication Technologies from Theory to Applications, 2008.
9. Guo-ping Jiang and Jing Wang, “Improved DES method based on the irrational number”, IEEE International Conference on Neural Networks and Signal Processing, 2008.
10. S.K. Tiong and M.B. Vishnu, “Security Enhancement of Digital Motion Image Transmission Using a Hybrid AES-DES Algorithm,” IEEE Int, 2008.
11. Zhang HanLi Zhaohui, Yuan Kun, “An Improved AES Algorithm Based on Chaos”, International Conference on Multimedia Information Networking and Security, INES’09, Volume 6, 2013.
12. Tingyuan Nie, Chuanwang Song, Xulong Zhi, Tingyuan Nie, Tingyuan Nie, Tingyuan Nie, Tingyuan Nie, “Performance Evaluation of DES and Blowfish Algorithms”, International Conference on Biomedical Engineering and Computer Science, 2010.
13. Wanggen Wan, Xiang Li, Junli Chen, Dinghu Qin “Research and Realization Based on Improved AES and ECC Hybrid Encryption Algorithms”, IEEE, 2010.
14. M. Zeghid, M. Machhout, L. Khriji, A. Baganne, and R. Tourki, “A modified AES-based method for picture encryption”, The World Academy of Science, Engineering, and Technology, 2007.
15. Abdinasir Hasan Ali, “Analysis and implementation of security methods for wireless communication”, IEEE, 2010.
16. Craig Teegarden, Mujit Bhargava, and Ken Mai, “Side-channel attack Resistant ROM based AES S-Box”, IEEE, 2010.
17. H. Nover, “A Comprehensive Framework for Enhancing Security in InfiniBand Architecture”, IEEE,2005.
18. H. Nover, “algebraic cryptanalysis of AES: an overview”, University of Wisconsin, USA, 2005.
19. Forouzan Behrouz, “Cryptography & Network Security”, McGraw-Hill, 2007.
20. E. Biham, A. Shamir, “Differential Cryptanalysis of DES-like Cryptosystems”, Journal of Cryptology, Vol.4, №1, 1991, pp. 3–72.
21. X. Lai, “On the Design and Security of Block Ciphers, ETH Series in Information Processing”, Editor: J. L. Massey, Vol. 1, 1992.
22. B. Schneier, “The Non-Security of Secrecy,” Communications of the ACM, vol. 47, no. 10, pp. 120–120, 2004.
23. O. O. Khalifa, M. R. Islam, S. Khan, and M. S. Shebani, “Communications cryptography,” in RF and Microwave Conference, 2004. RFM 2004. Proceedings, Selangor, 2004.