Presented Encryption Algorithm Research Articles

A Chaos-Based Encryption Algorithm for Database System

This paper introduces a new Database Transposition, Substitution and XORing Algorithm (DTSXA) based on using chaotic maps. It is based primarily on two well-known security properties: confusion and diffusion. A random number generator was depended on to produce the keys for the algorithm of encryption and decryption. The encryption of the Arabic language in addition to the English language was done, besides it can encrypt a table, individual row and individual column. The suggested algorithm was obeyed and analyzed by different tests involving brute force attack analyses, statistical attack analyses (security analysis histogram, correlation coefficient analysis and information entropy analysis), key sensitivity analysis, differential attack analysis, and mean square error analysis. This algorithm passed all the applied analyses well-deservedly, which indicates that the presented encryption algorithm has a high security level due to its large key space and high sensitivity to the change in the cipher keys.

Color image encryption algorithm based on Double layer Josephus scramble and laser chaotic system

In this paper, a color image encryption algorithm is presented, the new algorithm uses double-layer Joseph’s scramble, XOR diffusion, and is built on a laser chaos system. Firstly, a laser chaotic system is chosen in the scheme and it has the advantages of extended bandwidth and rapid propagation speed. Secondly, the structure of the image encryption scheme follows the Fridrich structure. In the scrambling part, a modified Joseph’s ring is adapted to process the chaotic sequence and the picture pixel sequence to achieve the scrambling of the plaintext image pixel positions. In the diffusion part, the XOR diffusion technique is employed to reduce the statistical characteristics of the plaintext picture, which can resist external attacks better. Finally, the presented encryption algorithm is demonstrated utilizing simulation results and security analysis. The simulation performance demonstrates that the new proposed method is practical. The security test performance indicates that the algorithm can validly encrypt the image with good security performance. In summary, the new scheme designed in this paper can offer better technical backing for the wide applications of image encryption.

A Chaos‐Based Image Encryption Scheme Is Proposed Using Multiple Chaotic Maps

Everybody wants to maintain solitariness to some extent or entirely in his dealings with other people during different modes of communication. To retain privacy, researchers materialized distinct image encryption algorithms using chaotic maps. Due to their extraordinary features, most researchers employed multidimensional chaotic maps to barricade clandestine information or digital images from potential invaders. Still, multidimensional chaotic maps have many impediments conferred in the literature review. In this paper, we developed a cryptosystem utilizing multiple chaotic maps to mitigate the shortcoming of multidimensional chaotic maps. A distinctive approach is adopted to sire a key stream using a combination of chaotic maps and create a sequence of random integers linked with the pixels of the plain image to shatter the association between neighboring pixels of a plain image. Finally, diffusion is accomplished using the previously diffused pixels at a decimal level. Security and statistical analysis demonstrate that the presented encryption algorithm is robust against well‐known attacks. An ample key space indicates that it is best suited for secure communication.

An image encryption algorithm based on a novel 1D chaotic map and compressive sensing

A new image encryption algorithm is presented based on a novel chaotic map and compressive sensing with excellent performance. At first, the sparse coefficient matrix is acquired by discrete wavelet transform (DWT) of the original image. Secondly, the SHA-512 hash value of the original image are regarded as the initial values of two novel 1D chaotic maps to generate two chaotic sequences. Furthermore, the measurement matrix is generated by one of the two chaotic maps. Next, the measurement result is scrambled based on bit-plane operations by another chaotic sequence. At last, the diffusion and rotation operations are carried out on the shuffled matrix to improve the security index of the proposed algorithm. It is indicated through the analyses of simulation experiment that the presented encryption algorithm is effective to resist statistical attacks, plaintext attacks and brute-force attacks and has good compression effect and robustness.

Modified PRESENT Encryption algorithm based on new 5D Chaotic system

Cryptography is a major concern in communication systems. IoE technology is a new trend of smart systems based on various constrained devices. Lightweight cryptographic algorithms are mainly solved the most security concern of constrained devices and IoE systems. On the other hand, most lightweight algorithms are suffering from the trade-off between complexity and performance. Moreover, the strength of the cryptosystems, including the speed of the algorithm and the complexity of the system against the cryptanalysis. A chaotic system is based on nonlinear dynamic equations that are sensitive to initial conditions and produce high randomness which is a good choice for cryptosystems. In this work, we proposed a new five-dimensional of a chaotic system for a lightweight cryptographic algorithm. The proposed new chaotic system considers as super chaos. The NIST suite of all 15th tests is examined the proposed algorithm and showed high randomness and complexity.

Image Encryption Algorithm Based on a Novel Six-Dimensional Hyper- Chaotic System

Due to the rapid evaluation in the field of communications and multimedia and the increasing use of the Internet, multimedia data security has become very urgent. of the best alternative way to achieve multimedia data security is encryption, which prevents unauthorized entities from accessing confidential data. In recent years, the chaotic system of image encryption becomes an efficient way to encrypt images due to its high security. It has certain special properties like sensitivity to initial conditions, and control parameters, pseudorandom, ergodicity, and non-convergence, etc. chaotic dynamics systems became a promising alternative to traditional encryption algorithms. In this paper, This paper presents a new algorithm for the image encryption/decryption scheme depended on a novel six-dimensional hyper-chaotic system to achieve a high level of security, the chaotic sequence generated from system employ for permutation and diffusion the original image to create an encrypted image. The performance of the algorithm has been analyzed through analyzes statistical such as Histogram Analysis, Correlation Coefficient Analysis, Information Entropy Analysis, Key Space Analysis, Key Sensitivity Analysis, Number of Pixels Change Rate (NPCR), Unified Average Changing Intensity (UACI), Peak Signal to Noise Ratio, The experimental results show that the algorithm has good encryption performance, large keyspace equals to and the high sensitivity for small changes in secret key which makes the algorithm immune to Brute force attacks, and it can resist the statistical attacks, therefore, the presented encryption algorithm depends on a novel hyperchaotic system is more secure against the statistical and differential attacks.

Providing End-to-End Security Using Quantum Walks in IoT Networks

Internet of Things acts an essential role in our everyday lives and it definitely has the potential to grow on the importance and revolutionize our future. However, the present communication technologies have several security related issues which is required to provide secure end to end connectivity among services. Moreover, due to recent, rapid growth of quantum technologies, most common security mechanisms considered secure today may be soon imperilled. Thus, the modern security mechanisms during their construction also require the power of quantum technologies to resist various potential attacks from quantum computers. Because of its characteristics, quantum walks (QW) is considered as a universal quantum computation paradigm that can be accepted as an excellent key generator. In this regard, in this paper a new lightweight image encryption scheme based on QW for secure data transfer in the internet of things platforms and wireless networking with edge computing is proposed. The introduced approach utilises the power of nonlinear dynamic behaviour of QW to construct permutation boxes and generates pseudo-random numbers for encrypting the plain image after dividing it into blocks. The results of the conducted simulation and numerical analyses confirm that the presented encryption algorithm is effective. The encrypted images have randomness properties, no useful data about the ciphered image can be obtained via analysing the correlation of adjacent pixels. Moreover, the entropy value is close to 8, the number of the pixel change rate is greater than 99.61%, and there is high sensitivity of the key parameters with large key space to resist various attacks.

Color image DNA encryption using NCA map-based CML and one-time keys

In this paper, we introduce a novel color image encryption algorithm based on DNA sequence operations, one-time keys and the spatiotemporal chaos. Firstly, the key streams are generated by the NCA map-based CML, where the hash function SHA-256 is used to update the system parameters and initial conditions combining with the plain-image and the secret keys. Secondly, decompose the plain-image into the red, green, blue components, and convert them randomly into three DNA matrices by the DNA encoding rules. Further, combine three DNA matrices into a new DNA matrix, and then perform the row-wise and column-wise permutations on it. Thirdly, divide the shuffled DNA matrix into three equal blocks and implement the DNA addition, subtraction and XOR operations on these DNA blocks. Finally, transform the DNA matrices into the decimal matrices separately according to the DNA decoding rules. To enhance the security of the cryptosystem, a diffusion process is further carried out by using the key streams. Thus, the resulting cipher-image is attained. Experimental results and security analysis show that the presented encryption algorithm has a good encryption effect and can resist various typical attacks.

A Random PRESENT Encryption Algorithm Based on Dynamic S-box

S-box mainly plays the role of confusion in the encryption process as an important component. For the new encryption algorithm PRESENT proposed in 2007, S-box impacts on the security of the encryption algorithm directly. This paper briefly describes the process of PRESENT algorithm and proposes an improved S-box to solve the problem that the original PRESENT S-box has anti-fixed point. Then a random PRESENT encryption algorithm based on dynamic S-box is proposed. The dynamic multiple S-boxes technology is used to implement random PRESENT algorithm, to enhance the security of the cryptographic algorithm. Finally, the security analysis is done, and it suggests that dynamic S-box has a superior ability to resist differential attack and linear attack. By comparison to the diffusion rate of original PRESENT S-box, our dynamic S-box has better avalanche effect. With the rapid development of the Internet of Things, the radio frequency identification (RFID), wireless sensor network (WSN), and other new technologies go deep into all aspects of people's work and life. However, RFID and WSN are based on wireless network to transfer information. The transmission of information is not difficult to be obtained, interfered, and even destroyed by the attackers. So information security technology is widely used in protecting networks to enhance the safety of secret information. And the traditional symmetric encryption algorithm is often restricted by hardware, which cannot achieve good effects under the condition of limited hardware and power consumption. Therefore, lightweight cipher algorithm such as PRESENT(1) and LED(2) has gradually become the realistic choice to ensure the information security of Internet of Things. The lightweight block encryption algorithm PRESENT (1), put forward by Bogdanov in 2007, is carefully designed with area and power constraints uppermost in limited conditions. So the PRESENT algorithm still has high security in the application of limited space and power consumption, such as sensor network node. However, the permutation transformation of PRESENT algorithm is different with the column confusion of AES. It uses bit as the permutation function input unit while AES uses byte for permutation. The permutation layer of PRESENT encryption algorithm is a perfectly symmetrical structure and easy implemented. Because the structure of this kind of design has poor diffusibility, the PRESENT algorithm diffusively quality mainly depends on the diffusion properties of S-box. So S-box, as a nonlinear component in lightweight block encryption algorithm, affects the strength of the whole structure of the cipher. To strengthen DES by using existing hardware, an improved method of DES which uses the S-box related to a key is put forward in paper (4), and the researcher has demonstrated the safety of the improved method. Meanwhile, a new key related