An Efficient and Secure Image Encryption Algorithm Based on Non- Adjacent Coupled Maps

Abstract

In this paper, an image encryption algorithm based on non-adjacent coupled map lattices is designed. Compared with coupled map lattices, non-adjacent coupled map lattices have few periodic windows in bifurcation, and larger parameter range in chaos dynamics. Combined with the proposed chaotic system, a new alternative encryption structure between permutation, diffusion and substitution is proposed to improve the security and encryption efficiency of the algorithm. In the diffusion process, multiplication operation in GF (257) and addition operation in GF (2) based on look-up table are adopted, which improves the encryption efficiency and enhances the permutation effect by choosing pixel value in Latin Square during the diffusion process. Moreover, based on the good cryptographic characteristics of the s-box, a dynamic sbox related to plaintext is constructed to substitute plaintext pixels. Experimental results and security analysis show that the proposed encryption scheme can resist all types of typical attacks and has good encryption effect. INDEX TERMS SHA-256, Non adjacent coupled map lattices, Dynastic s-box, Latin Square, 3D Arnold GF (257), GF (2) This work is licensed under a Creative Commons Attribution 4.

A Novel Intermittent Jumping Coupled Map Lattice Based on Multiple Chaotic Maps

“…In summary, the ideas of the above works [7][8][9][10][11]13,14,16,17,[22][23][24] mainly concentrate on three aspects: non-adjacent coupling [7][8][9][10][11], dynamical coupling [13,14,16,22,23], and multi-chaos mixing [17,24]. Based on our analysis, there still exist some problems in the three aspects.…”

“…To increase the spatial diffusion, reference [10] provided a hybrid-coupling mechanism that considers the adjacent and non-adjacent interactions simultaneously. Later, Zhang et al [11] employed a 3D Arnold cat map to establish coupling relations between lattices, which enlarges the chaotic regime over a wide range of parameters. In [12], Liu et al developed a NCML-based S-box shuffling method, which strengthens the ability to resist linear password attacks.…”

“…Based on our analysis, there still exist some problems in the three aspects. First, for the non-adjacent coupling, most of the previous works [7][8][9][10][11] merely adopted the Arnold cat map to determine the spatial positions of coupled lattices. However, we find that the Arnold cat map will repeatedly sample the same spatial position at a regular period.…”

“…Our work studies the chaotic behaviors and nonlinear phenomena induced by the intermittent jumping mechanism, and observes the spatiotemporal chaos of the IJCML system from the following perspectives: diffusion energy analysis, power spectrum analysis, equilibrium degree analysis, information entropy analysis, inter-lattice independence analysis, Lyapunov exponent analysis, bifurcation diagram analysis, spatiotemporal behavior analysis, and computational complexity analysis. Note that these perspectives are widely chosen by [7][8][9][10][11]13,14,16,17,[22][23][24] for analyzing a dynamical system. We will conduct extensive numerical simulations and comparative studies in Section 3.…”

PiouCrypt: Decentralized Lattice-based Method for Visual Symmetric Cryptography

“…Another related work was proposed in [29] based on Arnold logistic lattice model, where the key similar to method of [26] was separating into several parts, as well as input image. Next, the value of key gets involved with a logistic-dynamic coupled map lattice model (LDCML) as equation 2 shows; where logistic map denoted by f (x), and sequence number and iterations are i (L ≥ i ≥ 1) and n respectively.…”