Non-Linear Hopped Chaos Parameters-Based Image Encryption Algorithm Using Histogram Equalization

Multimedia wireless communications have rapidly developed over the years. Accordingly, an increasing demand for more secured media transmission is required to protect multimedia contents. Image encryption schemes have been proposed over the years, but the most secure and reliable schemes are those based on chaotic maps, due to the intrinsic features in such kinds of multimedia contents regarding the pixels’ high correlation and data handling capabilities. The novel proposed encryption algorithm introduced in this article is based on a 3D hopping chaotic map instead of fixed chaotic logistic maps. The non-linearity behavior of the proposed algorithm, in terms of both position permutation and value transformation, results in a more secured encryption algorithm due to its non-convergence, non-periodicity, and sensitivity to the applied initial conditions. Several statistical and analytical tests such as entropy, correlation, key sensitivity, key space, peak signal-to-noise ratio, noise attacks, number of pixels changing rate (NPCR), unified average change intensity randomness (UACI), and others tests were applied to measure the strength of the proposed encryption scheme. The obtained results prove that the proposed scheme is very robust against different cryptography attacks compared to similar encryption schemes.

Download Full-text

A image encryption algorithm based on chaotic Lorenz system and novel primitive polynomial S-boxes

Multimedia Tools and Applications ◽

10.1007/s11042-021-10695-5 ◽

2021 ◽

Author(s):

Temadher Alassiry Al-Maadeed ◽

Iqtadar Hussain ◽

Amir Anees ◽

Muhammad Tahir Mustafa

Keyword(s):

Image Encryption ◽

Chaotic System ◽

Initial Conditions ◽

Chaotic Map ◽

Irreducible Polynomial ◽

High Sensitivity ◽

Chaotic Sequence ◽

Encryption Algorithm ◽

Lorenz Chaotic System ◽

Image Encryption Algorithm

AbstractWe have proposed a robust, secure and efficient image encryption algorithm based on chaotic maps and algebraic structure. Nowadays, the chaotic cryptosystems gained more attention due to their efficiency, the assurance of robustness and high sensitivity corresponding to initial conditions. In literature, there are many encryption algorithms that can simply guarantees security while the schemes based on chaotic systems only promises the uncertainty, both of them can not encounter the needs of current scenario. To tackle this issue, this article proposed an image encryption algorithm based on Lorenz chaotic system and primitive irreducible polynomial substitution box. First, we have proposed 16 different S-boxes based on projective general linear group and 16 primitive irreducible polynomials of Galois field of order 256, and then utilized these S-boxes with combination of chaotic map in image encryption scheme. Three chaotic sequences can be produced by the disturbed of Lorenz chaotic system corresponding to variables x, y and z. We have constructed a new pseudo random chaotic sequence ki based on x, y and z. The plain image is encrypted by the use of chaotic sequence ki and XOR operation to get a ciphered image. To show the strength of presented image encryption, some renowned analyses are performed.

Download Full-text

A Novel Image Encryption Scheme Based on PWLCM and Standard Map

Complexity ◽

10.1155/2020/3026972 ◽

2020 ◽

Vol 2020 ◽

pp. 1-23

Author(s):

Yucheng Chen ◽

Chunming Tang ◽

Zongxiang Yi

Keyword(s):

Image Encryption ◽

Initial Conditions ◽

Piecewise Linear ◽

Chaotic Map ◽

Encryption Scheme ◽

Standard Map ◽

Diffusion Structure ◽

Piecewise Linear Chaotic Map ◽

Encryption Schemes ◽

And Performance

In the past decades, considerable attention has been paid to the chaos-based image encryption schemes owing to their characteristics such as extreme sensitivity to initial conditions and parameters, pseudo-randomness, and unpredictability. However, some schemes have been proven to be insecure due to using a single chaotic system. To increase the security, this work proposes a novel image encryption scheme based on the piecewise linear chaotic map (PWLCM) and the standard map. To the best of our knowledge, it is the first chaos-based image encryption scheme combining the PWLCM with the standard map, which adopts permutation-diffusion structure. Unlike the traditional scrambling way, a hierarchical diffusion strategy, which not only changes the pixel position but also modifies the value, is employed in the permutation phase. The operation model of row-by-row and column-by-column is further used to enhance the efficiency in the diffusion process. Consequently, a good trade-off efficiency and security can be achieved. Furthermore, the numerical simulations and performance analyses illustrate that the proposed encryption scheme can be used in practical application scenarios requiring lightweight security.

Download Full-text

Chaotic Image Encryption Algorithm Based on Bit Permutation and Dynamic DNA Encoding

Computational Intelligence and Neuroscience ◽

10.1155/2017/6919675 ◽

2017 ◽

Vol 2017 ◽

pp. 1-11 ◽

Cited By ~ 16

Author(s):

Xuncai Zhang ◽

Feng Han ◽

Ying Niu

Keyword(s):

Dna Sequence ◽

Image Encryption ◽

Initial Conditions ◽

Chaotic Map ◽

Security Analysis ◽

Encryption Algorithm ◽

Algebraic Operation ◽

Dna Encoding ◽

Spatial Configurations ◽

Image Encryption Algorithm

With the help of the fact that chaos is sensitive to initial conditions and pseudorandomness, combined with the spatial configurations in the DNA molecule’s inherent and unique information processing ability, a novel image encryption algorithm based on bit permutation and dynamic DNA encoding is proposed here. The algorithm first uses Keccak to calculate the hash value for a given DNA sequence as the initial value of a chaotic map; second, it uses a chaotic sequence to scramble the image pixel locations, and the butterfly network is used to implement the bit permutation. Then, the image is coded into a DNA matrix dynamic, and an algebraic operation is performed with the DNA sequence to realize the substitution of the pixels, which further improves the security of the encryption. Finally, the confusion and diffusion properties of the algorithm are further enhanced by the operation of the DNA sequence and the ciphertext feedback. The results of the experiment and security analysis show that the algorithm not only has a large key space and strong sensitivity to the key but can also effectively resist attack operations such as statistical analysis and exhaustive analysis.

Download Full-text

Image Encryption Algorithm Based on Substitution Principle and Shuffling Scheme

Engineering and Technology Journal ◽

10.30684/etj.v38i3b.433 ◽

2020 ◽

Vol 38 (3B) ◽

pp. 98-103

Author(s):

Atyaf S. Hamad ◽

Alaa K. Farhan

Keyword(s):

Image Encryption ◽

Chaotic Map ◽

Logistic Map ◽

Encryption Algorithm ◽

Second Phase ◽

Cipher Text ◽

The Face ◽

Substitution Principle ◽

2D Logistic Map ◽

Image Encryption Algorithm

This research presents a method of image encryption that has been designed based on the algorithm of complete shuffling, transformation of substitution box, and predicated image crypto-system. This proposed algorithm presents extra confusion in the first phase because of including an S-box based on using substitution by AES algorithm in encryption and its inverse in Decryption. In the second phase, shifting and rotation were used based on secrete key in each channel depending on the result from the chaotic map, 2D logistic map and the output was processed and used for the encryption algorithm. It is known from earlier studies that simple encryption of images based on the scheme of shuffling is insecure in the face of chosen cipher text attacks. Later, an extended algorithm has been projected. This algorithm performs well against chosen cipher text attacks. In addition, the proposed approach was analyzed for NPCR, UACI (Unified Average Changing Intensity), and Entropy analysis for determining its strength.

Download Full-text

A New Image Encryption Scheme Using Dual Chaotic Map Synchronization

The International Arab Journal of Information Technology ◽

10.34028/iajit/18/1/11 ◽

2020 ◽

Vol 18 (1) ◽

Keyword(s):

Image Encryption ◽

Chaotic Systems ◽

Initial Conditions ◽

Chaotic Map ◽

Security Applications ◽

The Common ◽

And Diffusion ◽

Confusion And Diffusion ◽

Sensitivity To Initial Conditions ◽

Diffusion Properties

Chaotic systems behavior attracts many researchers in the field of image encryption. The major advantage of using chaos as the basis for developing a crypto-system is due to its sensitivity to initial conditions and parameter tunning as well as the random-like behavior which resembles the main ingredients of a good cipher namely the confusion and diffusion properties. In this article, we present a new scheme based on the synchronization of dual chaotic systems namely Lorenz and Chen chaotic systems and prove that those chaotic maps can be completely synchronized with other under suitable conditions and specific parameters that make a new addition to the chaotic based encryption systems. This addition provides a master-slave configuration that is utilized to construct the proposed dual synchronized chaos-based cipher scheme. The common security analyses are performed to validate the effectiveness of the proposed scheme. Based on all experiments and analyses, we can conclude that this scheme is secure, efficient, robust, reliable, and can be directly applied successfully for many practical security applications in insecure network channels such as the Internet

Download Full-text