Encryption and decryption of images with chaotic map lattices

A Three-Dimensional Infinite Collapse Map with Image Encryption

Chaos is considered as a natural candidate for encryption systems owing to its sensitivity to initial values and unpredictability of its orbit. However, some encryption schemes based on low-dimensional chaotic systems exhibit various security defects due to their relatively simple dynamic characteristics. In order to enhance the dynamic behaviors of chaotic maps, a novel 3D infinite collapse map (3D-ICM) is proposed, and the performance of the chaotic system is analyzed from three aspects: a phase diagram, the Lyapunov exponent, and Sample Entropy. The results show that the chaotic system has complex chaotic behavior and high complexity. Furthermore, an image encryption scheme based on 3D-ICM is presented, whose security analysis indicates that the proposed image encryption scheme can resist violent attacks, correlation analysis, and differential attacks, so it has a higher security level.

A Novel S-Box Dynamic Design Based on Nonlinear-Transform of 1D Chaotic Maps

In this paper, a method to enhance the dynamic characteristics of one-dimension (1D) chaotic maps is first presented. Linear combinations and nonlinear transform based on existing chaotic systems (LNECS) are introduced. Then, a numerical chaotic map (LCLS), based on Logistic map and Sine map, is given. Through the analysis of a bifurcation diagram, Lyapunov exponent (LE), and Sample entropy (SE), we can see that CLS has overcome the shortcomings of a low-dimensional chaotic system and can be used in the field of cryptology. In addition, the construction of eight functions is designed to obtain an S-box. Finally, five security criteria of the S-box are shown, which indicate the S-box based on the proposed in this paper has strong encryption characteristics. The research of this paper is helpful for the development of cryptography study such as dynamic construction methods based on chaotic systems.

Hyperchaotic Image Encryption Based on Multiple Bit Permutation and Diffusion

Image security is a hot topic in the era of Internet and big data. Hyperchaotic image encryption, which can effectively prevent unauthorized users from accessing image content, has become more and more popular in the community of image security. In general, such approaches conduct encryption on pixel-level, bit-level, DNA-level data or their combinations, lacking diversity of processed data levels and limiting security. This paper proposes a novel hyperchaotic image encryption scheme via multiple bit permutation and diffusion, namely MBPD, to cope with this issue. Specifically, a four-dimensional hyperchaotic system with three positive Lyapunov exponents is firstly proposed. Second, a hyperchaotic sequence is generated from the proposed hyperchaotic system for consequent encryption operations. Third, multiple bit permutation and diffusion (permutation and/or diffusion can be conducted with 1-8 or more bits) determined by the hyperchaotic sequence is designed. Finally, the proposed MBPD is applied to image encryption. We conduct extensive experiments on a couple of public test images to validate the proposed MBPD. The results verify that the MBPD can effectively resist different types of attacks and has better performance than the compared popular encryption methods.

Bogdanov Map-based Permuted Double Image Encryption

Chaos-based image encryption schemes shuffle the position of the pixels (confuse), change their values (diffuse), to camouflage the identity of the original image. In this paper, a symmetric image cryptosystem based on permutation is proposed. Permutation, used both to change the position of the pixel and modify its value, is undertaken using the Bogdanov map. First, the input image is permuted using the Bogdanov map so that the pixel positions are changed. Thereafter, the resultant scrambled image is sliced into bit-planes which are again separately subjected to the Bogdanov map. The encrypted image is constructed by encrypting the scrambled bit-planes with the key generated using dyadic transform. The experimental results exhibited random behavior in the distribution of the pixel values of the encrypted image. The cryptosystem is simple and fast, as it is permutation-based and, secure, it may be used in real-time transmission.

Image encryption based on the pseudo-orbits from 1D chaotic map

Chaotic systems have been extensively applied in image encryption as a source of randomness. However, dynamical degradation has been pointed out as an important limitation of this procedure. To overcome this limitation, this paper presents a novel image encryption scheme based on the pseudo-orbits of 1D chaotic maps. We use the difference of two pseudo-orbits to generate a random sequence. The generated sequence has been successful in all NIST tests, which implies it has adequate randomness to be employed in encryption process. Confusion and diffusion requirements are also effectively implemented. The usual low key space of 1D maps has been improved by a novelty procedure based on multiple perturbations in the transient time. A factor using the plain image is one of the perturbation conditions, which ensures a new and distinct secret key for each image to be encrypted. The proposed encryption scheme has been efficaciously verified using the Lena, Baboon, and Barbara test images.

Generalized double-humped logistic map-based medical image encryption

This paper presents the design of the generalized Double Humped (DH) logistic map, used for pseudo-random number key generation (PRNG). The generalized parameter added to the map provides more control on the map chaotic range. A new special map with a zooming effect of the bifurcation diagram is obtained by manipulating the generalization parameter value. The dynamic behavior of the generalized map is analyzed, including the study of the fixed points and stability ranges, Lyapunov exponent, and the complete bifurcation diagram. The option of designing any specific map is made possible through changing the general parameter increasing the randomness and controllability of the map. An image encryption algorithm is introduced based on pseudo-random sequence generation using the proposed generalized DH map offering secure communication transfer of medical MRI and X-ray images. Security analyses are carried out to consolidate system efficiency including: key sensitivity and key-space analyses, histogram analysis, correlation coefficients, MAE, NPCR and UACI calculations. System robustness against noise attacks has been proved along with the NIST test ensuring the system efficiency. A comparison between the proposed system with respect to previous works is presented.

Symmetric encryption algorithms using chaotic and non-chaotic generators: A review

This paper summarizes the symmetric image encryption results of 27 different algorithms, which include substitution-only, permutation-only or both phases. The cores of these algorithms are based on several discrete chaotic maps (Arnold's cat map and a combination of three generalized maps), one continuous chaotic system (Lorenz) and two non-chaotic generators (fractals and chess-based algorithms). Each algorithm has been analyzed by the correlation coefficients between pixels (horizontal, vertical and diagonal), differential attack measures, Mean Square Error (MSE), entropy, sensitivity analyses and the 15 standard tests of the National Institute of Standards and Technology (NIST) SP-800-22 statistical suite. The analyzed algorithms include a set of new image encryption algorithms based on non-chaotic generators, either using substitution only (using fractals) and permutation only (chess-based) or both. Moreover, two different permutation scenarios are presented where the permutation-phase has or does not have a relationship with the input image through an ON/OFF switch. Different encryption-key lengths and complexities are provided from short to long key to persist brute-force attacks. In addition, sensitivities of those different techniques to a one bit change in the input parameters of the substitution key as well as the permutation key are assessed. Finally, a comparative discussion of this work versus many recent research with respect to the used generators, type of encryption, and analyses is presented to highlight the strengths and added contribution of this paper.

An efficient and secure medical image protection scheme based on chaotic maps

Recently, the increasing demand for telemedicine services has raised interest in the use of medical image protection technology. Conventional block ciphers are poorly suited to image protection due to the size of image data and increasing demand for real-time teleradiology and other online telehealth applications. To meet this challenge, this paper presents a novel chaos-based medical image encryption scheme. To address the efficiency problem encountered by many existing permutation-substitution type image ciphers, the proposed scheme introduces a substitution mechanism in the permutation process through a bit-level shuffling algorithm. As the pixel value mixing effect is contributed by both the improved permutation process and the original substitution process, the same level of security can be achieved in a fewer number of overall rounds. The results indicate that the proposed approach provides an efficient method for real-time secure medical image transmission over public networks.

Comment on "Encryption and decryption of images with chaotic map lattices" [Chaos 16, 033118 (2006)]

In this paper, we comment on the chaotic encryption algorithm proposed by A. N. Pisarchik et al. [Chaos 16, 033118 (2006)]. We demonstrate that the algorithm is not invertible. We suggest simple modifications that can remedy some of the problems we identified.

On the security of a new image encryption scheme based on chaotic map lattices

This paper reports a detailed cryptanalysis of a recently proposed encryption scheme based on the logistic map [A. Pisarchik et al., Chaos 16, 033118 (2006)]. Some problems are emphasized concerning the key space definition and the implementation of the cryptosystem using floating-point operations. It is also shown how it is possible to reduce considerably the key space through a ciphertext-only attack. Moreover, a timing attack allows for the estimation of part of the key due to the existent relationship between this part of the key and the encryption/decryption time. As a result, the main features of the cryptosystem do not satisfy the demands of secure communications. Some hints are offered to improve the cryptosystem under study according to those requirements.