An image blocks encryption algorithm based on spatiotemporal chaos

In this paper, the CML-based spatiotemporal chaos system is used for image blocks encryption, which gets higher security. The basic idea is to divide the image into blocks, and then use the block numbers as the spatial parameter of CML to iterate the chaos system. Each lattice generates a chaos sequence, and the number of chaos sequence values is equal to the pixels number of each block. The chaos sequences and the former block plaintext codecide the substitution and diffusion of each block. Simulation results show that the performance and security of the proposed encryption system can encrypt the image effectively and resist various typical attacks.     

A chaotic image encryption algorithm based on perceptron model

Based on the high-dimension Lorenz chaotic system and perceptron model within a neural network, a chaotic image encryption system with a perceptron model is proposed. This paper describes the algorithm flow in detail, and analyses the cryptographic security. The experimental results show that this algorithm has high security, and strong resistance to the existing attack methods.     

Breaking a chaotic image encryption algorithm based on perceptron model

Recently, a chaotic image encryption algorithm based on the perceptron model was proposed. The present paper analyzes the security of the algorithm and finds that the equivalent secret key can be reconstructed with only one pair of known-plaintext/ciphertext, which is supported by both mathematical proof and experiment results. In addition, two other security defects are also reported.     

A new image alternate encryption algorithm based on chaotic map

In this paper, a new image alternative encryption algorithm is proposed, in which the shuffling and diffusion are performed simultaneously. The plain image is divided into two left and right blocks of same size. The matrix which is generated by a logistic map is used to diffuse the left block of the plain image. Then, the diffused image is used as the right block of the cipher image. The 0, 1 sequence which comes from another logistic chaotic sequence and plaintext is used to shuffle the right block of the cipher image. After the operation XOR, the left block of cipher image is generated. Finally, two new-generated blocks are merged into the cipher image. In order to get better effect for image encryption, this process can be repeated many rounds. The simulation results show that this algorithm has properties of big key space, high sensitivity to key, resisting statistical analysis, differential attacks, plaintext attacks, and chosen-plaintext attacks. So, it has high security and can be suitable for image encryption.     

Breaking a novel colour image encryption algorithm based on chaos

Recently, a colour image encryption algorithm based on chaos was proposed by cascading two position permutation operations and one substitution operation, which are all determined by some pseudo-random number sequences generated by iterating the logistic map. This paper evaluates the security level of this encryption algorithm and finds that the position permutation-only part and the substitution part can be separately broken with only ?(log₂(3MN))/8? and 2 chosen plain-images, respectively, where MN is the size of the plain-image. The effectiveness of the proposed chosen-plaintext attack is supported by concise theoretical analyses, and is verified by experimental results.     

An image encryption algorithm based on compound homogeneous hyper-chaotic system

A new dynamic model of a rotating flexible beam with a concentrated mass located in arbitrary position is derived based on the absolute nodal coordinate formulation, and its modal characteristics are investigated in this paper. To consider the concentrated mass at an arbitrary location of the beam, a Dirac’s delta function is used to express the mass per unit length of the beam. Based on the proposed dynamic model, the frequency analysis is performed. The nonlinear equation is transformed into the linear one via employing the linear perturbation analysis method. The stiffness matrix of static equilibrium of the system under the deformed condition is obtained, in which the effect of coupling between the longitudinal deformation and transversal deformation is included. This means even if only the chordwise bending equation is solved, the longitudinal vibration effect can be still considered. As we know, once the longitudinal deformation is large, it will significantly affect the chordwise bending vibration. So the proposed model in this paper is more accurate than the traditional dynamic models which are usually lack of the coupling terms between the longitudinal deformation and transversal deformation. In fact, the traditional dynamic models for the chordwise vibration analysis in the existing literature are usually linear due to neglecting the coupling terms, and consequently, they are only suitable for the modal characteristic analysis of a beam under small deformations. In order to get some general conclusions of the natural frequencies and mode shapes, the equation which governs the chordwise bending vibration of the rotating beam is transformed into a dimensionless form. The dynamic model presented in this paper is nonlinear and can be conveniently used to analyze the modal characteristics of a rotating flexible beam with large deformations. To demonstrate the power of the new dynamic model presented in this paper, the dynamic simulations involving the comparisons between the different frequencies obtained using the model proposed in this paper and the models in the existing literature and the investigating in frequency veering and mode shift phenomena are given. The simulation results show that the angular velocity of the flexible beam will give rise to the phenomena of the natural frequency loci veering and the associated mode shift which is verified in the previous studies. In addition, the phenomena of the natural frequency loci veering rather than crossing can be observed due to the changing of the magnitude of the concentrated mass or of the location of the concentrated mass which are found for the first time. Furthermore, there is an interesting phenomenon that the natural frequency loci will veer more than once due to different types of mode coupling between the bending and stretching vibrations of the rotating beam. At the same time, the mode shift phenomenon will occur correspondingly. Additionally, the characteristics of the vibration nodes are also investigated in this paper.     

A fast color image encryption algorithm based on hyper-chaotic systems

This paper presents a new way of image encryption scheme, which consists of two processes; key stream generation process and one-round diffusion process. The first part is a pseudo-random key stream generator based on hyper-chaotic systems. The initial conditions for both hyper-chaotic systems are derived using a 256-bit-long external secret key by applying some algebraic transformations to the key. The original key stream is related to the plain-image which increases the level of security and key sensitivity of the proposed algorithm. The second process employs the image data in order to modify the pixel gray-level values and crack the strong correlations between adjacent pixels of an image simultaneously. In this process, the states which are combinations of two hyper-chaotic systems are selected according to image data itself and are used to encrypt the image. This feature will significantly increase plaintext sensitivity. Moreover, in order to reach higher security and higher complexity, the proposed method employs the image size in key stream generation process. It is demonstrated that the number of pixel change rate (NPCR) and the unified average changing intensity (UACI) can satisfy security and performance requirements (NPCR \(>\) 99.80 %, UACI \(>\) 33.56 %) in one round of diffusion. The experimental results reveal that the new image encryption algorithm has the advantages of large key space, high security, high sensitivity, and high speed. Also, the distribution of gray-level values of the encrypted image has a semi-random behavior.     

A novel bit permutation-based image encryption algorithm

Nonlinear Dynamics - In recent years, substantial work has been done for developing image encryption algorithms. Image encryption requires handling of large data, which needs computationally...     

An efficient pixel-level chaotic image encryption algorithm

Nonlinear Dynamics - In this paper, a new and efficient pixel-level image encryption algorithm is presented. In contrast to the traditional permutation–diffusion architecture, the proposed...     

A block image encryption algorithm based on wave transmission and chaotic systems

A block-based image encryption algorithm using wave function and chaotic system is presented. A random sequence generated by the chaotic system is used to find the source point in the wave and produces a diffusion matrix for modular operation. In the encryption process, the keystream is dependent on both the plain-image and the secret key. It changes in each encryption round. Theoretical analyses and simulation results show the high security of the proposed method, including the large key space, fairly uniform histogram, zero correlation between neighbouring pixels, resistance to differential attacks, and high efficiency. Therefore, our algorithm is a practical scheme for digital image encryption.     

An efficient chaotic image encryption algorithm based on a generalized Arnold map

An efficient image encryption algorithm using the generalized Arnold map is proposed. The algorithm is composed of two stages, i.e., permutation and diffusion. First, a total circular function, rather than the traditional periodic position permutation, is used in the permutation stage. It can substantially reduce the correlation between adjacent pixels. Then, in the stage of diffusion, double diffusion functions, i.e., positive and opposite module, are utilized with a novel generation of the keystream. As the keystream depends on the processed image, the proposed method can resist known- and chosen-plaintext attacks. Experimental results and theoretical analysis indicate the effectiveness of our method. An extension of the proposed algorithm to other chaotic systems is also discussed.     

A fast image encryption algorithm based on non-adjacent dynamically coupled map lattice model

Nonlinear Dynamics - This paper proposes a new logistic-dynamic Arnold coupled logistic map lattice model (LDACLML), where coupling coefficient is logistics map. According to the analysis of...     

Algebraic analysis of a RGB image encryption algorithm based on DNA encoding and chaotic map

Recently a new image encryption method based on DNA encoding and chaotic systems has been proposed. In this paper, several weaknesses of this cryptosystem are pointed out. Equivalent mathematical model of the cryptosystem is designed and algebraic analysis is given. Moreover reduction of the key space has been reached by finding equivalent keys. A recovering scheme is finally given with a lower complexity than the actual decryption scheme.