Original Advanced Encryption Standard Research Articles

Large file encryption in a reduced-round permutation-based AES file management system

In the rapid evolving digital landscape, the imperative to ensure data security has never been more crucial. This paper addresses the pressing challenges in data security by introducing a file encryption management system, leveraging a modified advanced encryption standard (AES) algorithm with reduced round iterations and bit permutation. This system aims to comprehensively secure various file types, providing a dependable solution for file exchange. Our findings reveal substantial improvements in both encryption and decryption processes using the reduced-round permutation-based AES (RRPBA). The adapted algorithm demonstrates a significant 38.8% acceleration in encryption time and a remarkable 44.86% improvement in decryption time, positioning it as a pivotal component for efficient file operations within the management system. Moreover, the throughput assessments showcase a remarkable 33.73% improvement in encryption and 23.72% in decryption, outperforming the original AES, emphasizing the algorithm's superior computational effectiveness, signaling positive implications for future high-performance applications. In conclusion, the study not only addresses critical security challenges but also presents a viable solution with tangible speed advantages for file encryption and decryption processes within digital file management systems.

Enhancing Data Protection through Advanced Encryption or Improving Data Security with Advanced Encryption

The protection of information content is becoming a key concern with the recent exponential growth of digital data interchange over computer networks. Numerous security vulnerabilities can readily jeopardize the information sent over a network. An enhanced modification for the Advanced Encryption Standard (AES) algorithm is proposed and implemented using an additional key that generated using a linear feedback shift register (LFSR), which provides an efficient technique to pseudo random number generation and also reduces the number of rounds. Cryptography plays a crucial role in ensuring the security of digital data transmission over these unsafe networks. When compared to the original AES algorithm result, the suggested technique produces the expected results for several data types, including text, images, It is more important than ever to strengthen data protection procedures in an era of rising cyber dangers and growing reliance on digital data. A thorough framework for "Enhancing Data Protection through Advanced Encryption" (EDPAE) is introduced in this study. The project's goal is to protect sensitive data by utilizing state-of-the-art encryption techniques in response to the ever-changing cyber security scenario. In addition, the project places a strong emphasis on how to seamlessly incorporate advanced encryption into current data storage and communication systems in order to minimize interference with user operations and greatly improve overall security posture. In order to guarantee the secure creation, distribution, and storage of encryption keys and to reduce potential risks related to key compromise, key management features are addressed.

AES-128 reduced-round permutation by replacing the MixColumns function

Ensuring the protection of digital data is of utmost importance in our current reliance on network operations. However, security measures such as data encryption often result in decreased performance speed. This paper enhanced the 128-bit version of the advanced encryption standard (AES) by substituting the MixColumns function with a permutation-based approach and decreasing the overall number of rounds. The evaluation results indicate a substantial enhancement in the speed of encryption and decryption, with a 76.76% improvement in encryption time and a 55.46% improvement in decryption time. Furthermore, it is important to mention that the modifications implemented in the standard AES did not compromise its security in relation to the strict avalanche criterion. The avalanche effect of the modified AES is 52.92%, surpassing the minimum requirement of 50%. Finally, the modified AES demonstrated a 31.12% increase in throughput for encryption and a 25.50% increase for decryption when compared to the original AES, using the sample dataset.

Modifying the AES Algorithm by Improving the Add Round Key Stage

This study offers a new adjustment to the Advanced Encryption Standard (AES) in order to assure a high degree of security. This is achieved by replacing the binary (XOR) operation with a new (Xo) operation in each add-round-key stage. The Xo operation generated an extra six randomly selected control keys determined by six state tables (2, 4, 6, 8, 10, and 12) produced from the addition operation in the Galois Field GF (2^2 ,2^4 ,2^6 , 2^8, 2^10 and 2^12 ) in order to boost the algorithm's unpredictability. In the suggested method, an adversary requires at least probabilities of keys to break the message; hence, it improves the difficulty of the original AES against brute force attacks. also enhances the performance of additional security metrics, such as NIST tests, compared to the original AES. Consequently, this replacement, including the use of six keys in both the encryption and decryption processes, offers a new level of security and a higher degree of resistance to data breaches. The novelty of the proposed (Xo) technique lies in the construction of GF tables ( 2^6 , 2^10 and 2^12) to be used in the encryption and decryption process for the first time, as well as the approach utilized to create the code for it.

An innovative method for enhancing advanced encryption standard algorithm based on magic square of order 6

This paper introduces an improved advanced encryption standard (AES) cipher algorithm by proposing a new algorithm based on magic square to decrease the AES execution time. This is done by replacing Mixcolumn function with magic square of order 6. This paper raises the security level of AES cryptosystem by using another key, which is generated using magic square while decreasing the execution time. For application of encrypting a colouring image, visual studio and MATLAB programs have been used as means for computing results. The results of complexity, time execution, National Institute of Standards and Technology (NIST) tests, histogram, differential attacks and peak signal to noise ratio (PSNR) are computed and compared with the original AES cryptosystem, the original and the proposed algorithms. The proposed algorithm results in reasonable findings under several evaluation metrics. For instance, the complexity of our proposed algorithm is higher than the basic AES while decreases the time execution. The experimental results show that the suggested algorithm provides an efficient and secure way for image encryption. The suggested algorithm leads to leverage the complexity of cipher process as well as to make the linear and differential cryptanalysis harder by pre-process the input image initial step of the proposed AES.

An Image Encryption Algorithm Based on Discrete-Time Alternating Quantum Walk and Advanced Encryption Standard.

This paper proposes an image encryption scheme based on a discrete-time alternating quantum walk (AQW) and the advanced encryption standard (AES). We use quantum properties to improve the AES algorithm, which uses a keystream generator related to AQW parameters to generate a probability distribution matrix. Some singular values of the matrix are extracted as the key to the AES algorithm. The Rcon of the AES algorithm is replaced with the elements of the probability distribution matrix. Then, the ascending order of the size of the clone probability distribution matrix scrambles the mapping rules of the S-box and ShiftRow transformations in the AES algorithm. The algorithm uses a probability distribution matrix and plaintext XOR operation to complete the preprocessing and uses the modified AES algorithm to complete the encryption process. The technology is based on simulation verification, including pixel correlation, histograms, differential attacks, noise attacks, information entropy, key sensitivity, and space. The results demonstrate a remarkable encryption effect. Compared with other improved AES algorithms, this algorithm has the advantages of the original AES algorithm and improves the ability to resist correlation attacks.

Design and Implementation of a Lightweight and Fast Tiny Advanced Encryption Standard Algorithm

Cryptographic algorithms are gaining importance due to their relevance and importance in the areas of privacy and security experienced by the Internet of Things (IoT) devices. They improve data privacy and confidentiality by limiting who can decrypt the data to the person who has the key. Advanced encryption standard (AES) is one of the most important encryption algorithms in use. This algorithm uses 10 rounds for each encryption and decryption process and encrypts data starting with 16 bytes, which increases the time needed for encryption and decryption. In order to speed up encryption and decryption while maintaining security levels more than or equal to those offered by the AES algorithm, this paper proposes an algorithm called tiny advanced encryption standard (TAES) with two different scenarios. As the encryption process starts with 4 bytes and goes up to an unlimited number of bytes, TAES features are less complex and more flexible than those of AES and can be quickly implemented, and are characterized by high encryption of images, texts, and sounds. The proposed TAES algorithm is tested on text and images using the MATLAB software. The result is completely distorted images and text. The test results also unveil that the encryption and decryption speeds as well as the throughput of the proposed TAES is much better than those of the original AES algorithm. Moreover, a low signal-to-noise ratio (SNR) values are obtained, indicating a greater degree of image distortion as a consequence of utilizing the proposed TAES algorithm.

Modified Advanced Encryption Standard algorithm for fast transmitted data protection

With the exponential growth of digital data exchange over the computer network in recent times, protection of information content is becoming a major concern. There are many security risks, which can easily compromise the data transmitted over the network. Cryptography plays an important role in ensuring the security of digital data transmission over these unsafe networks,so in order to ensure secure and fast data transmitted over the network, an enhanced modification for Advanced Encryption Standard (AES) algorithm is proposed and implemented using additional key which generated using linear feedback shift register(LFSR), which provide an efficient technique to pseudo random number generation,also rounds number are decreased . The proposed method give promised result comparing with original AES algorithm result for different data type text, image, and video.

Enhancing advance encryption standard security based on dual dynamic XOR table and MixColumns transformation

An efficient approach to secure information is critically needed at present. Cryptography remains the best approach to achieve security. On this basis, the National Institute of Standards and Technology (NIST) selected Rijndael, which is a symmetric block cipher, as the advanced encryption standard (AES). The MixColumns transformation of this cipher is the most important function within the linear unit and the major source of diffusion. Dynamic MixColumns transformation can be used to enhance the AES security. In this study, a method to enhance the AES security is developed on the basis of two methods. The first method is an extension of a previous study entitled “A novel Approach for Enhancing Security of Advance Encryption Standard using Private XOR Table and 3D chaotic regarding to Software quality Factor.” In the current study, the fixed XOR operation in AES rounds is replaced with a dual dynamic XOR table by using a 3D chaotic map. The dual dynamic XOR table is based on 4 bits; one is used for even rounds, and the other is used for odd rounds. The second method is dynamic MixColumns transformation, where the maximum distance separable (MDS) matrix of the MixColumns transformation, which is fixed and public in every round, is changed with a dynamic MDS matrix, which is private, by using a 3D chaotic map. A 3D chaotic map is used to generate secret keys. These replacements enhance the AES security, particularly the resistance against attacks. Diehard and NIST tests, entropy, correlation coefficient, and histogram are used for security analysis of the proposed method. C++ is used to implement the proposed and original algorithms. MATLAB and LINX are used for the security analysis. Results show that the proposed method is better than the original AES.

Advanced encryption standard based on key dependent S‐Box cube

The advanced encryption standard (AES) is the most encryption algorithm used around the world. This fact made it coveted by several cryptanalysis attacks. Some of them succeed to reveal certain weakness, due to its static parameters known by the public mass. The substitution box (S-Box) is among the most sensitive parameters of this standard, which plays a crucial role in the protection against these attacks. In this study, a new version of AES is introduced, which uses a set of AES-like S-Boxes instead of the original one. These S-Boxes, generated from different irreducible polynomials, are dynamically chosen, depending on the encryption key. This introduction is conducted by the design and the implementation of a new block cipher version of AES, based on a key dependent S-Box cube. Where a cube of six interchangeable S-Boxes key-dependently generated is constructed. This cube determines the active S-Box for a given round, through its random rotations guided by the round key. Furthermore, the improvement of the cryptographic robustness, provided by this method is demonstrated. This is accomplished through a comparison with the original AES, in terms of statistical and cryptographic randomness properties.

Internet of Things Security using New Chaotic System and Lightweight AES

The Internet of Things (IoT)services and application were increasing during the last years in several life fields causes need to provide a secure identifier for protecting sensing data passing between IoT sensors/devices and embedded-subsystem connected by networks. This paper was proposed an algorithm for helping in IoT communication security can used in different IOT entities used in unofficial industrial machine to machine (M2M) communications, smart energy-grids, home or buildings and other computing devices. 
 This paper proposed a secure system using new proposed 4D chaotic system combined with the modified lightweight Advanced Encryption Standard (AES). The proposed 4-dimension (4D) chaos system Lyapunov was tested and pass for many initial periods and get a super chaos system (4 positive Lyapunov). Generated chaos keys (used JORN) were used in the lightweight AES and the Secure Hash Algorithm version 3 (SHA3-256). The Lightweight AES was design in case to reduce CPU computation cycles and complexity of AES. Results show that computation time for proposed system decreased (has 145% speedup more). The output of modified lightweight AES encryption System has the good statistical tests near to original AES that can avoid many attacks.

A novel SPN-based video steganographic scheme using Sudoku puzzle for secured data hiding

Video steganography is the method of hiding the presence of data within the cover video. In this paper, a novel video steganography technique is revealed, where with the help of Sudoku puzzle of order 9 × 9, extracted image frames of a cover video are utilized to hide encrypted data. The novelties of the work imply that as the input information is first encrypted into cipher text using a new modified substitution and permutation network (SPN)-type block cipher, then, that cipher text is embedded in the video using Sudoku puzzle as a key. This new and robust encryption model is like a block cipher in comparison with Advanced Encryption Standard (AES) that provides enhanced resistance in case of fault attack. This new SPN-type architecture differs with AES architecture in the step of round key mixing function. Its computation complexity is much higher compared to original AES to find 128 bits of tenth round key. Therefore, our proposed work combines both cryptographic and steganographic technique and Sudoku puzzle to enhance the security in maximum level with optimal computational complexity and good embedding capacity rate.

RK-AES: An Improved Version of AES Using a New Key Generation Process with Random Keys

Advanced Encryption Standard (AES) is a standard algorithm for block ciphers for providing security services. A number of variations of this algorithm are available in network security domain. In spite of the strong security features, this algorithm has been recently broken down by the cryptanalysis processes. Therefore, it is required to improve the security strength of this algorithm as AES is popular in commercial use. In this paper, we have shown the reasons of the loopholes in AES and also have provided a solution by using our Symmetric Random Function Generator (SRFG). The use of randomness in the key generation process in block cipher is novel in this domain. We have also compared our results with the original AES based upon some parameters such as nonlinearity, resiliency, balancedness, propagation characteristics, and immunity. The results show that our proposed version of AES is better in withstanding attacks.

Further Improving Efficiency of Higher Order Masking Schemes by Decreasing Randomness Complexity

Most cryptographic implementations are vulnerable to side-channel attacks. Among the countermeasures, masking is the most popular one. In the field of provable secure masking schemes, it is a tough task to design a masking scheme for the multiplication with related multiplicands. Among all the corresponding solutions, the one proposed by Coron et al. in FSE 2013 achieves the best efficiency. Furthermore, in CRYPTO 2015, we claim that this scheme can be extended to secure any quadratic functions and therefore enables secure evaluation of S-box, which significantly outperforms any other methods. In this paper, we further promote the efficiency of Coron’s scheme by decreasing the random generations according to two observations. First, by modifying each pair of intermediate values on two sides of a diagonal line, half of all the required random values can be removed. Second, some randomness can be reused. All random values in one out of two lines can be replaced with the same random value. According to these two observations, we propose two new schemes. The first proposal improves the original scheme with a 50% randomness reduction and satisfies a stronger compositional security notion ${d}$ -SNI, while the second proposal improves the original scheme with a 50%–75% randomness reduction and satisfies a weaker compositional security notion ${d}$ -TNI. We give the security proof for both schemes. Moreover, we give an example of the masked Advanced Encryption Standard (AES) inversion circuits where both the first and second proposals are applied, significantly outperforming the original AES inversion with a 43%–57% saving of random generations. This indicates that our proposals can be used to build secure and efficient implementations of cryptographic algorithms.

Analysis of Development of Dynamic S-Box Generation

Advanced Encryption Standard is a symmetric block cipher which is widely used in encrypting data by different organizations to make secure their data from being hacked. The only nonlinear part of Advanced Encryption Standard (AES) is S-Box (Substitution Box), which provides confusion in the algorithm. But the main limitation of the S-Box in AES is that it is a static one throughout the algorithm, which is the main center of attraction for the cryptanalyst to analysis the weakness for certain attacks. Since 2000 onwards a number of algebraic attacks on AES have been carried out, which challenged the security of AES. But at the same time till date a number of researches have being carried out for making AES more secure by using dynamic S-Boxes to provide more confusion to the cryptanalyst. In present paper we tried to address dynamic S-Box techniques and provide their analysis on the basis of S-Box properties, which are essential for secure S-Box construction like Non-linearity, XOR profile, Strict Avalanche criterion (SAC) and Bit independence criteria (BIC). Also these techniques are compared with the original AES results.

PFD—A Flexible Higher-Order Masking Scheme

Based on the idea of secret sharing, masking is one of the most popular countermeasure to prevent side channel attacks (SCAs). Despite the redundant time and resource consumption, the existing masking schemes have constant speed and resources, and thus unsuitable for different applications with variable demand for time or space. Motivated by the reconfiguration technology of programmable hardware and disjunctive normal form expression of any logic function, we define a random variable logic circuit to reach the same security for any-order masking schemes. During the encryption, we induce random sequences and utilize them as configuration sequences to generate variable logic circuits, whose results are independent from the original and divided into several shares. We call our new approach polynomial function division (PFD) masking. Furthermore, we analyze the effectiveness and proof the security of PFD in theory. Our experiments using PFD on the advanced encryption standard (AES) algorithm show that the space complexity is almost as small as an implementation of the original AES without any countermeasure. Moreover, due to the flexible structure of PFD, the cost-to-efficiency ratio of PFD is much lower than state-of-the art in software, and its flexibility is coin with the reconfigurable chip.

A Modified Advanced Encryption Standard Algorithm for Image Encryption

Cryptography algorithms are becoming more necessary to ensure secure data transmission, which can be used in several applications. Increasing use of images in industrial process therefore it is essential to protect the confidential image data from unauthorized access. Advanced Encryption Standard (AES) is a well- known block cipher that has many benefits in data encryption process. In this paper, proposed some modification to the Advanced Encryption Standard (M-AES) to increase and reaching high level security and enhance image encryption. The modification is done by modifying the ShiftRow Transformation. Detailed results in terms of security analysis and implementation are given. Comparing the proposed algorithm with the original AES encryption algorithm shows that the proposed M-AES has more security from the cryptographic view and gives better result of security against statistical attack.

Developing a new Hybrid Cipher using AES, RC4 and SERPENT for Encryption and Decryption

This paper aims at developing a new hybrid cipher by combining the characteristics of 3 ciphers namely AES (Advanced Encryption Standard),Rc4 (also known as ARC4) and Serpent. The characteristics of both the ciphers are studied and a new cipher combining the characteristics of both the ciphers is generated which is more secure than the original ciphers. AES, SERPENT characteristics are its security and its resistance against attacks and the major characteristic of Rc4 is its speed. Therefore these characteristics are imbibed in the newly generated cipher. Thus it proves to be faster than the original AES and secure against most attacks. Three combination techniques have been formulated to generate a hybridized cipher and the procedure along with the strengths and weaknesses outlined. The third cipher is the major cipher which is focused on in this paper. It is also shown that this cipher is resistant against most attacks. This will ensure the secrecy and confidentially of the messages it is used to encrypt.

An Amalgam Approach using AES and RC4 Algorithms for Encryption and Decryption

This paper aims at developing a new hybrid cipher by combining the characteristics of two ciphers namely AES(Advanced Encryption Standard) and Rc4(also known as ARC4). The characteristics of both the ciphers are studied and a new cipher combining the characteristics of both the ciphers is generated which is more secure than the original ciphers. AES characteristics are its security and its resistance against attacks and the major characteristic of Rc4 is its speed. Therefore these characteristics are imbibed in the newly generated cipher. Thus it proves to be faster than the original AES and secure against most attacks. Three combination techniques have been formulated to generate a hybridized cipher and the procedure along with the strengths and weaknesses outlined. The third cipher is the major cipher which is focussed on in this paper. It is also shown that this cipher is resistant against most attacks. This will ensure the secrecy and confidentially of the messages it is used to encrypt. General Terms Hybrid, higher security, speed improvement, combination of ciphers, confidentiality, encryption, decryption.

An Efficient Modified Advanced Encryption Standard (MAES) Adapted for Image Cryptosystems

AbstractSecurity in transmission storage of digital images has its importance in today's image communications and confidential video conferencing. Advanced Encryption Standard (AES) is a well known block cipher that has several advantages in data encryption. However, it is not suitable for real-time applications. In this paper, we present a modification to the Advanced Encryption Standard (MAES) to reflect a high level security and better image encryption. The modification is done by adjusting the ShiftRow phase. Experimental results verify and prove that the proposed modification to image cryptosystem is highly secure from the cryptographic viewpoint. The results also prove that with a comparison to original AES encryption algorithm the modified algorithm (MAES) gives better encryption results in terms of security against statistical attacks.