A novel chaotic image encryption scheme using DNA sequence operations

In this paper, we propose a novel image encryption scheme based on DNA (Deoxyribonucleic acid) sequence operations and chaotic system. Firstly, we perform bitwise exclusive OR operation on the pixels of the plain image using the pseudorandom sequences produced by the spatiotemporal chaos system, i.e., CML (coupled map lattice). Secondly, a DNA matrix is obtained by encoding the confused image using a kind of DNA encoding rule. Then we generate the new initial conditions of the CML according to this DNA matrix and the previous initial conditions, which can make the encryption result closely depend on every pixel of the plain image. Thirdly, the rows and columns of the DNA matrix are permuted. Then, the permuted DNA matrix is confused once again. At last, after decoding the confused DNA matrix using a kind of DNA decoding rule, we obtain the ciphered image. Experimental results and theoretical analysis show that the scheme is able to resist various attacks, so it has extraordinarily high security.     

Digital image encryption with chaotic map lattices

This paper proposes a secure approach for encryption and decryption of digital images with chaotic map lattices. In the proposed encryption process,eight different types of operations are used to encrypt the pixels of an image and one of them will be used for particular pixels decided by the outcome of the chaotic map lattices. To make the cipher more robust against any attacks,the secret key is modified after encrypting each block of sixteen pixels of the image. The experimental results and security analysis show that the proposed image encryption scheme achieves high security and efficiency.     

Probabilistic signatures of spatiotemporal intermittency in the coupled sine circle map lattice

The phase diagram of the coupled sine circle map system exhibits a variety of interesting phenomena including spreading regions with spatiotemporal intermittency, non-spreading regions with spatial intermittency, and coherent structures termed solitons. A spreading to non-spreading transition is seen in the system. A cellular automaton version of the coupled system maps the spreading to non-spreading transition to a transition from a probabilistic to a deterministic cellular automaton. The solitonic sector of the system shows spatiotemporal intermittency with soliton creation, propagation and absorption. A probabilistic cellular automaton mapping is set up for this sector which can identify each one of these phenomena.      

An image encryption scheme using generalized Arnold map and affine cipher

This paper aims to provide an image encryption scheme with an efficient bit-level permutation and a pixel-level diffusion procedure. In the bit-level permutation, we divide each pixel into 8 bits, and arrange the positions of each bit by the generalized Arnold map in row and column direction. Hence, a significant diffusion effect is happened in the bit-level permutation. In the pixel-level diffusion procedure, we apply affine cipher to change the gray value and the histogram distribution of the permutated image. Various types of security analyses demonstrate that the proposed scheme is competitive with that ordinary permutation–diffusion type image cipher and proper for practical image encryption.     

Cryptanalysis and improvement of a digital image encryption method with chaotic map lattices

A digital image encryption scheme using chaotic map lattices has been proposed recently. In this paper, two fatal flaws of the cryptosystem are pointed out. According to these two drawbacks, cryptanalysts could recover the plaintext by applying the chosen plaintext attack. Therefore, the proposed cryptosystem is not secure enough to be used in the image transmission system. Experimental results show the feasibility of the attack. As a result, we make some improvements to the encryption scheme, which can completely resist our chosen plaintext attack.     

Optical image encryption with redefined fractional Hartley transform

A new method for optical image encryption is introduced on the basis of two-dimensional (2-D) generalization of 1-D fractional Hartley transform that has been redefined recently in search of its inverse transform. We encrypt the image by two fractional orders and random phase codes. It has an advantage over Hartley transform, for its fractional orders can also be used as additional keys, and that, of course, strengthens image security. Only when all of these keys are correct, can the image be well decrypted. The optical realization is then proposed and computer simulations are also performed to confirm the possibility of the proposed method.     

An image encryption scheme based on new spatiotemporal chaos

Spatiotemporal chaos is chaotic dynamics in spatially extended system, which has attracted much attention in the image encryption field. The spatiotemporal chaos is often created by local nonlinearity dynamics and spatial diffusion, and modeled by coupled map lattices (CML). This paper introduces a new spatiotemporal chaotic system by defining the local nonlinear map in the CML with the nonlinear chaotic algorithm (NCA) chaotic map, and proposes an image encryption scheme with the permutation-diffusion mechanism based on these chaotic maps. The encryption algorithm diffuses the plain image with the bitwise XOR operation between itself pixels, and uses the chaotic sequence generated by the NCA map to permute the pixels of the resulting image. Finally, the constructed spatiotemporal chaotic sequence is employed to diffuse the shuffled image. The experiments demonstrate that the proposed encryption scheme is of high key sensitivity and large key space. In addition, the scheme is secure enough to resist the brute-force attack, entropy attack, differential attack, chosen-plaintext attack, known-plaintext attack and statistical attack.     

Directed percolation phase transition at the onset of STI in an inhomogeneous coupled map lattice

A model for inhomogeneously coupled logistic maps is considered to find some critical exponents in the transition from inhomogeneous steady state to spatiotemporal chaos through spatiotemporal intermittency. The laminar state in the model is described by inhomogeneous steady state with spatial period two. We obtain a complete set of static exponents which match with the corresponding directed percolation (DP) values in (1+1) dimension. We also find four nonuniversal spreading exponents in which three exponents are in agreement with DP values. The model in which absorbing state is inhomogeneous steady state, contributes a new example in evidence of Pomeau's [18] conjecture that the onset of STI in a deterministic system belongs to DP universality class.     

Bifurcations in globally coupled map lattices

The dynamics of globally coupled map lattices can be described in terms of a nonlinear Frobenius-Perron equation in the limit of large system size. This approach allows for an analytical computation of stationary states and their stability. The bifurcation behavior of coupled tent maps near the chaotic band merging point is presented. Furthermore, the time-independent states of coupled logistic equations are analyzed. The bifurcation diagram of the uncoupled map carries over to the map lattice. The analytical results are supplemented with numerical simulations     

Propagating fronts in a bistable coupled map lattice

We consider the (traveling-wave-like) fronts which propagate with rational velocityp/q in a simple coupled map lattice for which the local map has two stable fixed points. We prove the uniqueness of such orbits up to time iterations, space translations, and permutations of the associated codes. A condition for their existence is also given, but it has to be checked in each case. We expect this condition to serve as a selection mechanism. The technique employed, the so-called (generalized) transfer matrix method, allows us to give explicit expressions for these solutions. These fronts are actually the observed orbits in the numerical simulations, as is shown with two examples: the case of velocity 1/2 and that of velocity 1.     

Optical image encryption using Hartley transform and logistic map

We propose a new method for image encryption using Hartley transform with jigsaw transform and logistic map. Logistic map has been used to generate the random intensity mask which is known as chaotic random intensity mask. The problem of bare decryption with Hartley transform has been solved by using the jigsaw transform. In the proposed technique, the image is encrypted using two methods in which the second method is the extension of the first method. In the first method, the image is encrypted using Hartley transform and jigsaw transform. In the second method, the image is encrypted using Hartley transform, jigsaw transform and logistic map. The mean square errors and the signal to noise ratio have been calculated. Robustness of the technique in terms of blind decryption and the algorithmic complexity has been evaluated. The optical implementation has been proposed. The computer simulations are presented to verify the validity of the proposed technique.     

Color image encryption using skew tent map and hyper chaotic system of 6th-order CNN

The paper designs a color image encryption scheme based on skew tent map and hyper chaotic system of 6th-order CNN. The essence of the image encryption is to confuse and diffuse the pixels, the skew tent map is applied to generate the confusion sequence, and the hyper chaotic system of 6th-order CNN is applied to generate the diffusion sequence, for 6 state variables in the system, there are total 120 combinations. For each pixel of the plain image, one combination is chosen to encryption the red, green and blue components, and the combination is determined by one of the state variables. Each pixel is encrypted by the cipher value of the previous pixel and the combination value of the CNN system. Experimental results and security analysis demonstrate that the scheme can achieve good encryption result and larger key space, and can resist common attacks, so the scheme can be applied in secure communication to enhance the security of transmitting image.     

Entropy of coupled map lattices

The entropy of coupled map lattices with respect to the group of space-time translations is considered. We use the notion of generalized Lyapunov spectra to prove the analogue of the Ruelle inequality and the Pesin formula.     

Encrypting the compressed image by chaotic map and arithmetic coding

Due to the efficient and secure requirements of image transmission, a number of research works have been done to encrypt the compressed image. Inspired by the arithmetic coding and chaotic map which are used to compress and encrypt image, respectively. In this paper, a scheme is proposed to encrypt the compressed image by chaotic map and arithmetic coding. This scheme compresses the image row by row which is firstly permuted by two logistic maps before arithmetic coding. It not only enhances the security of arithmetic coding, but also improves the compression ratio. To further improve the security of binary data which has been compressed, we use the chaotic maps to encrypt the data, and set different parameters and initial value for chaotic maps. In order to possess high sensitivities of key and plain-image, the keys that are employed to determine the parameter and initial value of chaotic maps are related to the plain-image. The experimental results validate the effect of the proposed scheme and demonstrate that the compressed and encrypted image is secure and convenient for transmission.     

Analytical solutions of weakly coupled map lattices using recurrence relations

By using asymptotic methods recurrence relations are found that rule weakly CML evolution, with both global and diffusive coupling. The solutions obtained from these relations are very general because they do not hold restrictions about boundary conditions, initial conditions and number of oscilators in the CML. Furthermore, oscillators are ruled by an arbitraty C² function.     

单向耦合映象格子的时空混沌同步

以耦合映象格子为对象,研究了时空混沌系统的同步问题. 基于Lyapunov稳定性定理,通过恰当地选择驱动函数,实现了两个单向耦合映象格子的完全同步. 仿真模拟验证了这种同步方法的有效性. 讨论了控制参量对同步速率的影响. 仿真模拟还表明,在存在系统偏差并受到噪声影响的情况下,仍然可以实现两系统的同步,这种同步方法具有一定的抗干扰能力. 关键词： 时空混沌 同步 耦合映象格子     

Turing instability for a two-dimensional Logistic coupled map lattice

In this Letter, stability analysis is applied to a two-dimensional Logistic coupled map lattice with the periodic boundary conditions. The conditions of Turing instability are obtained, and various patterns can be exhibited by numerical simulations in the Turing instability region. For example, space-time periodic structures, periodic or quasiperiodic traveling wave solutions, stationary wave solutions, spiral waves, and spatiotemporal chaos, etc. have been observed. In particular, the different pattern structures have also been observed for same parameters and different initial values. That is, pattern structures also depend on the initial values. The similar patterns have also been seen in relevant references. However, the present Letter owes to pattern formation via diffusion-driven instabilities because the system is stable in the absence of diffusion.     

Optical image encryption using fractional Fourier transform and chaos

We propose a new method for image encryption using fractional Fourier transform and chaos theory. Random phase masks are generated using iterative chaos functions. The input image is combined with the first random phase mask at the object plane and is then transformed using the fractional Fourier transform. After the first fractional Fourier transform, the second random phase mask, again generated by using the chaos functions, is used at the fractional plane. The second fractional Fourier transform operation is then carried out to obtain the encrypted image. Three types of chaos functions have been used: the logistic map, the tent map and the Kaplan–Yorke map. The mean square error and the signal-to-noise ratio between the decrypted image and the input image for the correct order and the incorrect order of the fractional Fourier transform have been calculated. The computer simulations are presented to verify the validity of the proposed technique.     

Novel optical image encryption scheme based on fractional Mellin transform

A novel nonlinear image encryption scheme is proposed by introducing the fractional Mellin transform (FrMT) into the field of image security. As a nonlinear transform, FrMT is employed to get rid of the potential insecurity of the optical image encryption system caused by the intrinsic object-image relationship between the plaintext and the ciphertext. Different annular domains of the original image are transformed by FrMTs of different orders, and then the outputs are further encrypted by comprehensively using fractional Fourier transform (FrFT), amplitude encoding and phase encoding. The keys of the encryption algorithm include the orders of the FrMTs, the radii of the FrMT domains, the order of the FrFT and the phases generated in the further encryption process, thus the key space is extremely large. An optoelectronic hybrid structure for the proposed scheme is also introduced. Numerical simulations demonstrate that the proposed algorithm is robust with noise immunity, sensitive to the keys, and outperforms the conventional linear encryption methods to counteract some attacks.