Proposed Image Encryption Method Research Articles

Design and optimization of nonlinear component of block cipher: Applications to multimedia security

Nowadays, various image encryption schemes based on chaotic systems have been developed, each of them has its own limitations and strength in terms of security and computational speed. The proposed image encryption scheme utilizes 2-D maps without disturbing their mathematical structure, characterized by topological features such as chaotic behavior and fractal properties, namely the Zaslavasky, Bakers, and Henon Maps. This approach utilizes both confusion and diffusion stages to achieve high levels of security against various attacks. The confusion stage utilizes chaotic values to muddle the rows and columns of the image, reducing the correlations between neighboring pixels, while the diffusion step achieves the avalanche effect with 2D Bakers map and Henon map. The proposed image encryption scheme is analyzed thoroughly to evaluate its security and performance. To evaluate the security and computational efficiency of the proposed image encryption method, various analysis such as correlation, contrast, entropy, energy, homogeneity, and performance analyses are conducted. Moreover, the three proposed S-boxes are also tested to evaluate their effectiveness using cryptographic analysis tests such as nonlinearity, strict Avalanche criterion, differential probability, linear probability, and bit independence criterion, which we also utilized in our proposed image encryption scheme.

Hybrid partial differential elliptical Rubik’s cube algorithm on image security analysis

Purpose Several chaotic system-based encryption techniques have been presented in recent years to protect digital images using cryptography. The challenges of key distribution and administration make symmetric encryption difficult. The purpose of this paper is to address these concerns, the novel hybrid partial differential elliptical Rubik’s cube algorithm is developed in this study as an asymmetric image encryption approach. This novel algorithm generates a random weighted matrix, and uses the masking method on image pixels with Rubik’s cube principle. Security analysis has been conducted, it enhances and increases the reliability of the proposed algorithm against a variety of attacks including statistical and differential attacks. Design/methodology/approach In this light, a differential elliptical model is designed with two phases for image encryption and decryption. A modified image is achieved by rotating and mixing intensities of rows and columns with a masking matrix derived from the key generation technique using a unique approach based on the elliptic curve and Rubik’s cube principle. Findings To evaluate the security level, the proposed algorithm is tested with statistical and differential attacks on a different set of test images with peak signal-to-noise ratio, unified average changed intensity and number of pixel change rate performance metrics. These results proved that the proposed image encryption method is completely reliable and enhances image security during transmission. Originality/value The elliptic curve–based encryption is hard to break by hackers and adding a Rubik’s cube principle makes it even more complex and nearly impossible to decode. The proposed method provides reduced key size.

Method of encrypting images based on two multidimensional chaotic systems using fuzzy logic

The subject of the study: it is proposed to develop a method of image encryption with pixel permutation implemented using fuzzy logic and Hainaut mapping, as well as diffusion, which is implemented using the Lorenz system. Study objectives: To propose an effective way to apply the rules of fuzzy logic in relation to the values generated by the Henon mapping to implement the permutation of pixels in the image, which will provide a random permutation and increase the efficiency of the encryption method. Also, to achieve better security in the process of image encryption, the use of the diffusion process implemented using the Lorenz system. In addition, to increase the sensitivity of the encryption method to change the initial value of the component colors of the pixels will also be used in the encryption process. Investigation methods and research results: developed and presented a method of image encryption with pixel permutation implemented using fuzzy logic and Henon mapping, as well as diffusion, implemented using the Lorenz system. The initial values for the Henon mapping and the Lorenz system will be determined from the entered keyword, and the control parameters are set by the operator, while the values of the component colors of the pixels will also participate in the encryption process. In addition, before the process of rearranging the pixels in the image, the rules of fuzzy logic are implemented by Henon mapping. Also, the values of the component pixels before and after the diffusion procedure will be reduced to a single interval. Thus, as a result of image encryption, the original image changes completely, loses its content and shape, and the color intensity distribution of pixels becomes uniform. The program implementation of the proposed encryption method was also carried out and the qualitative characteristics of the proposed image encryption method were evaluated, namely: analysis of histograms of original and encrypted images, correlation of adjacent image pixels, root mean square error (MSE), peak signal-to-noise ratio (PSNR), entropy before changing the color components of the pixels. Conclusions: the implementation of the method has shown that it has a large number of encryption keys, which makes brute force (the process of their selection) resource-intensive and complex, and the implementation of the encryption process in two stages and using two different chaotic systems significantly improves the security of the encrypted image. The resulting cryptosystem is also resistant to the following attacks: approximation of chaotic orbits, correlation, analytical and statistical attacks.

Image Encryption Using a Spectrally Efficient Halton Logistics Tent (HaLT) Map and DNA Encoding for Secured Image Communication.

With the advancement of technology worldwide, security is essential for online information and data. This research work proposes a novel image encryption method based on combined chaotic maps, Halton sequence, five-dimension (5D) Hyper-Chaotic System and Deoxyribonucleic Acid (DNA) encoding. Halton sequence is a known low-discrepancy sequence having uniform distribution in space for application in numerical methods. In the proposed work, we derived a new chaotic map (HaLT map) by combining chaotic maps and Halton sequence to scramble images for cryptography applications. First level scrambling was done by using the HaLT map along with a modified quantization unit. In addition, the scrambled image underwent inter- and intra-bit scrambling for enhanced security. Hash values of the original and scrambled image were used for initial conditions to generate a 5D hyper-chaotic map. Since a 5D chaotic map has complex dynamic behavior, it could be used to generate random sequences for image diffusion. Further, DNA level permutation and pixel diffusion was applied. Seven DNA operators, i.e., ADD, SUB, MUL, XOR, XNOR, Right-Shift and Left-Shift, were used for pixel diffusion. The simulation results showed that the proposed image encryption method was fast and provided better encryption compared to ‘state of the art’ techniques. Furthermore, it resisted various attacks.

An Image Encryption Algorithm with Hermite Chaotic Polynomials and Scan Pattern

In today’s digital world, massive amount of sensitive information is being generated in the form of image and further it is shared via Internet. Maintaining the confidentiality of these data has become a major issue due to security vulnerability present in the network and transmission media. Image encryption algorithms are developed by various researchers to permit only authorized users to access and view sensitive images. This paper presents a novel image encryption scheme based on Hermite polynomials chaos function. First, random key stream is generated by using Hermite polynomial with different initial and incremental values of the variables. Next, the original image is scrambled with scan pattern to rearrange the pixels position. The scrambled image is XORed with the random key stream to get the encrypted image. The proposed method is experimented and observed that it is efficient and confirms the confusion and diffusion properties of a secure image encryption method. Large key space, low relation between the pixels of encrypted image, and sensitivity to initial seed value of the key are the strength of the proposed image encryption method.

Empirical Analysis of Robust Chaotic Maps for Image Encryption

The rate of transferring data in the form of text, image, video or audio over an open network has drastically increased. As these are carried out in highly sophisticated fields of medicine, military and banking, security becomes important. In- order to enhance security for transmission, encryption algorithms play a vital role. So as to enhance the proficiency of the existing encryption methods and for stronger anti attack abilities, chaotic based cryptography is essential. Chaotic based encryption has advantages of being sensitive to initial conditions and control parameters. Images have features like bulk data capacity and high inter pixel correlation. Transmission of such medical data should be highly confidential, integral and authorized. Hence chaos-based image encryption is an efficient way of fast and high-quality image encryption. It has features like good speed, complexity, highly secure, reasonable computational overhead and power. In this paper a comprehensive analysis and an evaluation regarding the capabilities of different discrete time domain chaotic maps were carried out on a proposed image encryption method. The experimental results show high efficiency for the proposed image encryption technique.

Novel Image Encryption Using a Pseudoset Generated by Chaotic Permutation Multicircular Shrinking With a Gradual Deletion of the Input Set

High-level security with a large keyspace and a short processing time is needed in digital image encryption. Generally, an encryption method that produces a large keyspace is characterized by a relatively slow encryption process. In this paper, we propose a new image encryption method that uses two chaotic pseudosets. A gradual deletion of the input set (GDIS) is introduced to enhance the process of chaotic permutation multicircular shrinking (CPMCS), herein referred to as GDIS CPMCS, to diffuse the image pixels and control the shift distance of the row and column rotations of an image. The proposed encryption scheme offers some advantages: it has a larger keyspace than the referenced image encryption schemes and a shorter processing time than CPMCS. The processing time of the proposed image encryption method with the GDIS CPMCS algorithm is 16.7 times faster for a gray image and 43 times faster for a color image than that in our previous work. Based on histogram and entropy analyses, the proposed scheme is also robust to statistical analysis. Moreover, the ciphered image has a very high degree of randomness according to the National Institute of Standards and Technology (NIST) randomness test results. In terms of differential analysis, a one-bit change in the original image leads to a substantial change in the ciphered image, as indicated by the unified average change intensity (UACI) and number of pixel change rate (NPCR) scores of 33.45% and 99.61%, respectively. Furthermore, GDIS CPMCS is robust to salt-and-pepper, Poisson, Gaussian, and speckle noise, with peak signal-to-noise ratios (PSNRs) higher than 14. The scheme is also robust to data loss since a reconstructed image with 50% data loss can be recognized, as indicated by a PSNR of 11.4.

Component Fusion Image Encryption Method Based on Hybrid Chaotic Model

The current image encryption method is relatively simple, and there is the problem of poor image encryption effect. Based on the hybrid chaotic model, an image encryption method with component fusion is proposed in this paper. The image is mapped by using Arnold cat mapping method. Chaotic sequence is generated by chaotic model, and the original image is scrambled and substituted to achieve image encryption. Through the fixed point ratio, information entropy, gray mean change value, autocorrelation and similarity, the test of encrypted image is completed. Experimental results show that the proposed image encryption method has good performance, high security intensity, and can effectively encrypt the image.

Image encryption using a synchronous permutation-diffusion technique

In the past decade, the interest on digital images security has been increased among scientists. A synchronous permutation and diffusion technique is designed in order to protect gray-level image content while sending it through internet. To implement the proposed method, two-dimensional plain-image is converted to one dimension. Afterward, in order to reduce the sending process time, permutation and diffusion steps for any pixel are performed in the same time. The permutation step uses chaotic map and deoxyribonucleic acid (DNA) to permute a pixel, while diffusion employs DNA sequence and DNA operator to encrypt the pixel. Experimental results and extensive security analyses have been conducted to demonstrate the feasibility and validity of this proposed image encryption method.

Proposed Method to Encrypt Images to Mobile Device Based on the Principles of Shannon

In the proposed research, it has been proposed image encryption method in the mobile device based on the principles of Shannon (diffusion and confusion). Where: a large group of keys is used. The process of entering the keys by the user is a very difficult In the proposed method; all the keys are extracted from the mathematical image properties, by a process of summation operation and the value of the mean. Image processing passes in to two phases, the first phase by using the output of the process of summation as a key to achieve the diffusion. In the second phase, the value of the mean is used as a seed to LFSR (Linear feedback register) to generate akey equal to the block of the image. Then process of the x or-operation (XOR) between the key and the block of image should be treated the output of these two phases is an image with the same of the original image size. Then by applying calculated time of encryption and decrypted are found the proposed method is simple, fast, and sensitive to the key. The suggested method meets the performance analysis examinations such as histogram, correlation, power spectrum, NPCR, UACI, Entropy and acceptable encryption speed; and it is resistant to statistical, brute force, and differential attacks.

A new RGB Image Encryption based on a Combination of 2D Chaotic Maps

this paper a new approach for RGB image encryption is based on a blend of 2D chaotic maps. Chaotic Henon map, chaotic Burger map and chaotic Gingerbreadman map is used in order to meet up the requirements of the protected image transmission. The proposed image encryption scheme is composed of two Transformation processes and two substitution processes. Different statistical methods, such as correlation coefficient, entropy, and histogram provide analysis of the efficiency of the proposed image encryption method. Keywordsmap, Burgers map, Gingerbreadman map, permutation, subsitution, Chaotic map.

A new color image encryption scheme using CML and a fractional-order chaotic system.

The chaos-based image cryptosystems have been widely investigated in recent years to provide real-time encryption and transmission. In this paper, a novel color image encryption algorithm by using coupled-map lattices (CML) and a fractional-order chaotic system is proposed to enhance the security and robustness of the encryption algorithms with a permutation-diffusion structure. To make the encryption procedure more confusing and complex, an image division-shuffling process is put forward, where the plain-image is first divided into four sub-images, and then the position of the pixels in the whole image is shuffled. In order to generate initial conditions and parameters of two chaotic systems, a 280-bit long external secret key is employed. The key space analysis, various statistical analysis, information entropy analysis, differential analysis and key sensitivity analysis are introduced to test the security of the new image encryption algorithm. The cryptosystem speed is analyzed and tested as well. Experimental results confirm that, in comparison to other image encryption schemes, the new algorithm has higher security and is fast for practical image encryption. Moreover, an extensive tolerance analysis of some common image processing operations such as noise adding, cropping, JPEG compression, rotation, brightening and darkening, has been performed on the proposed image encryption technique. Corresponding results reveal that the proposed image encryption method has good robustness against some image processing operations and geometric attacks.

IJARCCE - Computer and Communication Engineering

This paper presents a new methodology for image encryption. The SCAN-CA based image security system belongs to the stream cipher. Its encryption is based on permutations of image pixels and replacement of pixel values. The permutation is done with SCAN pattern generated by the SCAN methodology. SCAN patterns are developed based on the encryption specific SCAN language, which has production rule to generate a different SCAN grammar. The SCAN grammar produces a variable length scan key which is used for image encryption with CA substitution. Image pixel values are replaced using the recursive Cellular Automata substitution. Cellular Automata are dynamical systems in which time and space are discrete. The proposed image encryption method is lossless and it uses a very large number of secret keys. The pixel value permutation is key dependent. Thus, this encryption system finds a great scope in the field of security in terms of, grammar based key generation, large key space with time and space.

An Image Encryption Method Based on Independently and Uniformly Distributed Chaotic Key Stream

This study proposes an image encryption method using variable parameter one-dimensional chaotic system which can generate Independently and Uniformly Distributed (IID) chaotic key stream by the certain sampling way. Firstly, the paper introduces a fast algorithm to the theorem in [24] which can generate an IID chaotic key stream from a class of topologically conjugate maps of Tent Map. Secondly, an image encryption method is proposed, including the confusion and diffusion process as follows two steps: first the position of pixels in an image is confused by employing the pre-random sequence produced from chaotic value sort transformation; then the image pixel is encrypted by the IID key stream through XOR operation. Finally, the experiment is illustrated to prove that the proposed image encryption method is valid, and the algorithm can be used in the actual image encryption.

An image encryption based on elementary cellular automata

This paper presents a new image encryption/decryption scheme. The behavior of a number of elementary cellular automata (ECA) of length 8 with periodic boundary conditions is investigated. It is found in the state-transition diagram that some ECA rules result in state attractors which satisfies basic requirement of the encryption scheme that can perform encrypting function to transform the pixel values. The generation of these attractors depending only on the rule and initial state of the CA, without any additional hardware cost for the implementation, and requires minimized computational resources. Simulation results on some grayscale and color images show that the proposed image encryption method satisfies the properties of confusion and diffusion, execution speed and has perfect information concealing.

Image Encryption Based On Diffusion And Multiple Chaotic Maps

In the recent world, security is a prime important issue, and encryption is one of the best alternative way to ensure security. More over, there are many image encryption schemes have been proposed, each one of them has its own strength and weakness. This paper presents a new algorithm for the image encryption/decryption scheme. This paper is devoted to provide a secured image encryption technique using multiple chaotic based circular mapping. In this paper, first, a pair of sub keys is given by using chaotic logistic maps. Second, the image is encrypted using logistic map sub key and in its transformation leads to diffusion process. Third, sub keys are generated by four different chaotic maps. Based on the initial conditions, each map may produce various random numbers from various orbits of the maps. Among those random numbers, a particular number and from a particular orbit are selected as a key for the encryption algorithm. Based on the key, a binary sequence is generated to control the encryption algorithm. The input image of 2-D is transformed into a 1- D array by using two different scanning pattern (raster and Zigzag) and then divided into various sub blocks. Then the position permutation and value permutation is applied to each binary matrix based on multiple chaos maps. Finally the receiver uses the same sub keys to decrypt the encrypted images. The salient features of the proposed image encryption method are loss-less, good peak signal-to-noise ratio (PSNR), Symmetric key encryption, less cross correlation, very large number of secret keys, and key-dependent pixel value replacement.

Novel SCAN-CA-based image security system using SCAN and 2-D von Neumann cellular automata

This paper presents a novel SCAN-CA-based image security system which belongs to synchronous stream cipher. Its encryption method is based on permutation of the image pixels and replacement of the pixel values. Permutation is done by scan patterns generated by the SCAN approach. The pixel values are replaced using the recursive cellular automata (CA) substitution. The proposed image encryption method satisfies the properties of confusion and diffusion as the characteristics of SCAN and CA substitution are flexible. The salient features of the proposed image encryption method are lossless, symmetric private key encryption, very large number of secret keys, key-dependent permutation, and key-dependent pixel value replacement. Simulation results obtained using some color and gray-level images clearly demonstrate the strong performance of the proposed SCAN-CA-based image security system.

Image security system using recursive cellular automata substitution

This paper presents a novel image security system based on the replacement of the pixel values using recursive cellular automata (CA) substitution. This proposed image encryption method exhibits the properties of confusion and diffusion because of the characteristics of CA substitution are flexible. The salient features of the proposed image encryption method are its losslessness, symmetric private key encryption, very large number of secret keys, and key-dependent pixel value replacement. Simulation results obtained using some color and gray-level images clearly demonstrate the strong performance of the proposed image security system.