Image Encryption Using a New Hybrid Chaotic Map and Spiral Transformation.

A novel devaney chaotic map with uniform trajectory for color image encryption

An image encryption scheme based on new spatiotemporal chaos

A novel image encryption algorithm based on polynomial combination of chaotic maps and dynamic function generation

In this paper, a chaotic image encryption algorithm is suggested combining with double chaotic maps, SHA‐3 (Secure Hash Algorithm‐3), and auto‐updating system. To shuffle pixel positions, a matrix having same size of the plain‐image is generated dependent on the plain‐image in stage of permutation. Then, SHA‐3 is taken to calculate its hash values used to produce control parameter and initial condition of Logistic map. After that, total permutation is implemented for row and column to exchange pixels, where auto‐updating systems are established by different images acting like one‐time pad. Furthermore, 3D chaotic cat map is employed to enlarge key space in diffusion process. Permuted image is firstly divided into four sub‐blocks, which are queued randomly according to the key of Logistic map. The last sub‐block is picked out to calculate the hash values using SHA‐3, of which are assigned into three groups to update the initial conditions of 3D chaotic cat map performing like one‐time pad again. Current sub‐block is designed to influence next sub‐block in diffusion process. As a result, the proposed algorithm can resist efficiently the chosen‐plaintext and known‐plaintext attacks. Experimental results are also given to explain the high security of the proposed method. Copyright © 2016 John Wiley & Sons, Ltd.

In the last decade, the communication of images through the internet has increased. Due to the growing demands for data transfer through images, protection of data and safe communication is very important. For this purpose, many encryption techniques have been designed and developed. New and secured encryption schemes based on chaos theory have introduced methods for secure as well as fast communication. A modified image encryption process is proposed in this work with chaotic maps and orthogonal matrix in Hill cipher. Image encryption involves three phases. In the first phase, a chaotic Henon map is used for permuting the digital image. In the second phase, a Hill cipher is used whose encryption key is generated by an orthogonal matrix which further is produced from the equation of the plane. In the third phase, a sequence is generated by a chaotic tent map which is later XORed. Chaotic maps play an important role in the encryption process. To deal with the issues of fast and highly secured image processing, the prominent properties of non-periodical movement and non-convergence of chaotic theory play an important role. The proposed scheme is resistant to different attacks on the cipher image. Different tests have been applied to evaluate the proposed technique. The results of the tests such as key space analysis, key sensitivity analysis, and information entropy, histogram correlation of the adjacent pixels, number of pixel change rate (NPCR), peak signal to noise ratio (PSNR), and unified average changing intensity (UCAI) showed that our proposed scheme is an efficient encryption technique. The proposed approach is also compared with some state-of-the-art image encryption techniques. In the view of statistical analysis, we claim that our proposed encryption algorithm is secured.

Image encryption algorithm based on the finite fields in chaotic maps

The main purpose of the proposed image encryption (IE) method is to enhance various security characteristics to protect sensitive images on the internet. In the literature, chaotic maps are preferred for image encryption because of their high randomness and sensitivity to initial parameter values. Therefore, metaheuristic algorithms have been utilized to fine-tune the parameters. In this research, we have employed the metaheuristic Lyrebird optimization (LO) algorithm to fine-tune the chaotic map parameters. The LO algorithm is chosen over other algorithms due to its better exploration and exploitation rate to search for the best solution. The LO algorithm searches for the best parameter value based on the objective function. This research involves the formulation of a multi-objective function that incorporates numerous security parameters, namely, entropy and correlation coefficient (CC), to improve the security attributes of the IE model. The proposed IE model has two steps. In the first step, a random key is generated to transform the pixels of the secret image, whereas in the second step, the image pixels are shuffled based on the shuffling index values to reduce the correlation among the neighboring pixels. In both steps, we have used the chaotic logistic map. The proposed IE is evaluated against statistical and differential attacks on the standard dataset by considering the various images and their different resolutions. The uniform distribution of the histogram of the encrypted images is validated using the chi-square test. Besides that, entropy analysis shows that the average entropy value is 7.9973, 7.9993, and 7.9998 for 256x256, 512x512, and 1024x1024 image resolutions. The average CC and SSIM are near zero value. The average NPCR value (>0.9969) is near the 1 value. Finally, the comparative analysis based on entropy, CC, and NPCR parameters shows that the proposed IE model outperforms the existing models.

Color image encryption has enticed a lot of attention in recent years. Many authors proposed a chaotic system-based encryption algorithms for that purpose. However, due to the shortcomings of the low dimensional chaotic systems, similar rule structure for RGB channels, and the small keyspace, many of those were cryptanalyzed by chosen-plaintext or other well-known attacks. A Security vulnerability exists because of the same method being applied over the RGB channels. This paper aims to introduce a new three-channel three rules (3C3R) image encryption algorithm along with two novel mathematical models for DNA rule generator and bit inversion. A different rule structure was applied in the different RGB-channels. In the R-channel, a novel Block-based Bit Inversion (BBI) is introduced, in the G-channel Von-Neumann (VN) and Rotated Von-Neumann (RVN)- based 2D-cellular structure is applied. In the B-channel, a novel bidirectional State Machine-based DNA rule generator (SM-DNA) is introduced. Simulations and results show that the proposed 3C3R encryption algorithm is robust against all well-known attacks particularly for the known-plaintext attacks, statistical attacks, brute-force attacks, differential attacks, and occlusion attacks, etc. Also, unlike earlier encryption algorithms, the 3C3R has no security vulnerability.

Images are important information carriers in our lives, and images should be secure when transmitted and stored. Image encryption algorithms based on chaos theory emerge in endlessly. Based on previous various chaotic image fast encryption algorithms, this paper proposes a color image sector fast encryption algorithm based on one-dimensional composite sinusoidal chaotic mapping. The main purpose of this algorithm is to improve the encryption and decryption speed of color images and improve the efficiency of image encryption in the big data era. First, four basic chaos maps are combined in pairs and added with sine operations. Six one-dimensional composite sinusoidal chaos maps (CSCM) were obtained. Secondly, select the two best chaotic mappings LCS and SCS. The randomness of these two chaotic mappings was verified through Lyapunov index and NIST SP 800-22 randomness tests. Thirdly, the encryption process is carried out according to the shape of a traditional Chinese fan, and the diffusion and scrambling of each pixel of the image are performed in parallel. This greatly improves encryption speed. When diffusing, changing the value of one pixel can affect the values of multiple subsequent pixels. When scrambling, each pixel changes position with the three pixels before it according to the chaotic sequence. Finally, through many experiments, it is proved that the image encryption algorithm not only greatly improves the encryption and decryption speed, but also improves various indexes. The key space reached 2192, the average information entropy was 7.9994, the average NPCR was 99.6172, and the average UACI was 33.4646. The algorithm can also resist some common attacks and accidents, such as exhaustion attack, differential attack, noise attack, information loss and so on.

The rapid growth of online information transmission has made the secure transmission and storage of sensitive visual information crucial, particularly in light of the continuous increase in cyber threats. Traditional encryption algorithms are not very effective on images due to their very high pixel correlation, larger file sizes, and intrinsic redundancy. This paper presents a new framework of secure image encryption that will make use of advanced chaotic maps and cellular automata dynamics. It creates deterministic randomness, high sensitivity to initial conditions, and unpredictability through chaotic maps. CA introduces a series of dynamic, rule-based transformations that ensure robust properties for diffusion and confusion. During encryption, chaotic maps create pseudo-random sequences that control both the CA-based pixel scrambling and value transformation. This provides a very secure encryption method with many layers. It ensures high entropy in key generation, resistance against brute-force attacks, and high sensitivity to initial parameters. The scheme works because it can withstand differential, statistical, and noise-based attacks and show performance metrics like entropy analysis, correlation coefficients, histogram uniformity, and robustness. The suggested method is characterized by large-scale use, adaptability, and safety from modern cryptographic threats.

Chaos is widely used in secure communication and cryptography due to its randomness, unpredictability, non-periodicity and high sensitivity to initial values and parameters. However, there are many risks in some existing chaotic image encryption algorithms because they use the the chaotic map without complex dynamic characteristics. To overcome these weaknesses, in this paper introduced an improved Hénon map, and the dynamic analysis results show that the improved Hénon map has more rich chaotic behaviors and better complexity. In addition, we designed a color image encryption scheme using the improved Hénon sequences. For this encryption algorithm, color image is divided into R, G, B primary colors, then R, G, B primary colors are scrambled and diffused by the improved Hénon sequences. The simulation results illustrate that color image encryption algorithm security is advanced by usingimproved Hénon map.

For a gray image, every row (column) can be seen as an irregular wave. Activated by the architecture of permutation-diffusion based image encryption scheme, a chaotic image encryption algorithm is proposed to change the representation of irregular waves in the plain-image. To reduce the high correlation, permutation for both rows and columns is taken in the first stage. Due to the transposition of pixels in row/column, wave shapes will be changed according to the pseudo-random sequences generated from chaotic map. Specifically, pixels in each wave (row or column) are divided into two groups by energy (a bigger one and a smaller one). Then different groups are employed to manipulate the production of chaotic sequence. As a result, the chosen-plaintext and known-plaintext attacks will be difficult due to the plain-image dependent keystream. In the second stage, wave-by-wave diffusion in column is carried out such that any tiny change in the plain-image spreads out uniformly to the whole cipher-image. The keystream used in diffusion is designed again dependent on the permuted image obtained from the first stage. In this way, the security of the proposed algorithm can be further strengthened compared with some existing algorithms. Related security analyses also show that our method can satisfy common requirements of secure communication for daily images.

Due to the equivalent keys revealed by a chosen-plaintext attack or a chosen-ciphertext attack, most of the existing chaotic image encryption schemes are demonstrated to be insecure. In order to improve security performance, some scholars have recently proposed the plaintext-related chaotic image encryption scheme. Although the equivalent effect of a one-time pad is achieved, an additional secure channel is required to transmit the hash values or other parameters related to the plaintext before the ciphertext can be decrypted at the receiving end. Its main drawback is that an absolutely secure channel is needed to transmit the information related to the plaintext, which is not feasible in practical applications. To further solve this problem, this paper proposes a chaotic image encryption scheme based on global dynamic selection of a multi-parallel structure. First, a chaotic sequence is employed to dynamically select DNA encoding rules. Secondly, the permutation with a multi-parallel structure is performed on the DNA-encoded matrix, and the DNA decoding rules are dynamically selected according to another chaotic sequence. Finally, the diffusion rules obtained by the ciphertext feedback mechanism are introduced to determine the dynamic diffusion. Compared with the existing local dynamic encryption schemes, the main advantage of this scheme is that it can realize global dynamic selection, so as to ensure that there is no equivalent key, and it can resist the chosen-ciphertext attack or chosen-plaintext attack and does not need an additional secure channel to transmit parameters related to plaintext, which is practical. A theoretical analysis and numerical experiments demonstrate the feasibility of the method.

Image encryption is a hotspot of multimedia security. Many researchers adopted chaotic systems as pseudo-random number generators in image encryptions considering the properties of high sensitivity, large periodicity, low computation cost. Unpredictable, and etc. However, there is no deterministic approach to prove whether the way of using chaotic systems in an image encryption algorithm is secure or not. In this paper, a cryptanalysis is made to decipher a recent proposed chaotic JPEG image encryption algorithm by reforming the scrambled orders via correlation analysis, due to the improper use of chaotic sequence. Experimental results demonstrate the effectiveness of this method.

Exponentially increasing multimedia data over the internet raises concerns over its security. In the current work, we present a new technique for encrypting digital images based upon the pixel shuffling combined with changing pixel values using 128-bit secret key using henon chaotic map. Chaotic maps are characterized by their high sensitivity towards the initial parameters, which makes it a natural choice for developing a dynamic permutation matrix or as it is mostly called, permutation map. So we used chaotic Henon map in order to dynamically generate the permutation matrix. The initial parameters of the chaotic map and the secret key for changing the pixel values are derived from an external secret key. Horizontal and vertical permutations are used to perform pixel shuffling. Shuffling is used to destroy the correlation among the neighbour or adjacent image pixels, also it helps in increasing diffusion in the image. The proposed scheme is tested against a series of tests to measure its performance. Results of such tests indicate that the proposed algorithm is highly sensitive towards the encryption key and showed high resistance against various brute-force or statistical attacks.