•An efficient visually meaningful image compression and encryption (VMICE) scheme is proposed by combining compressive sensing (CS) and Least Significant Bit (LSB) embedding.•In pre-encryption, a ...compressed secret image is obtained by use of CS and Zigzag confusion – the resolution of the image is reduced and the data content is protected.•Dynamic LSB embedding process is controlled by random chaotic sequences generated from a 3-D Cat map, and out-of-order embedding increases the difficulty of the decoding process.•The adoption of LSB embedding allows for carrier image to be selected independently of plain image.
In this paper, an efficient visually meaningful image compression and encryption (VMICE) scheme is proposed by combining compressive sensing (CS) and Least Significant Bit (LSB) embedding. First, the original image (Iorig) is compressed and encrypted into a secret image (Isec) by CS and Zigzag confusion. Next, dynamic LSB embedding is utilized to randomly embed Isec into a separate carrier image (Icar) to create the final visually meaningful (VM) cipher image (Iciph), which is the same size as Iorig. To generate the measurement matrix for CS and determine the embedding position of Isec in Icar, a 3-D Cat map is employed. The utilization of this less-chaotic system makes our algorithm easy to implement. Moreover, the initial values of Cat map are computed using Iorig, making our image compression and encryption (ICE) algorithm robust to known-plaintext and chosen-plaintext attacks. Additionally, the adoption of LSB embedding allows for Icar to be selected independently of Iorig. Simulation results and performance analyses are presented to illustrate the effectiveness and efficiency of the proposed cryptosystem.
Different from existing methods that use matrix multiplications and have high computation complexity, this paper proposes an efficient generation method of n-dimensional (nD) Cat maps using Laplace ...expansions. New parameters are also introduced to control the spatial configurations of the nD Cat matrix. Thus, the proposed method provides an efficient way to mix dynamics of all dimensions at one time. To investigate its implementations and applications, we further introduce a fast implementation algorithm of the proposed method with time complexity O(n 4 ) and a pseudorandom number generator using the Cat map generated by the proposed method. The experimental results show that, compared with existing generation methods, the proposed method has a larger parameter space and simpler algorithm complexity, generates nD Cat matrices with a lower inner correlation, and thus yields more random and unpredictable outputs of nD Cat maps.
This paper proposes an image encryption scheme based on Cellular Automata (CA). CA is a self-organizing structure with a set of cells in which each cell is updated by certain rules that are dependent ...on a limited number of neighboring cells. The major disadvantages of cellular automata in cryptography include limited number of reversal rules and inability to produce long sequences of states by these rules. In this paper, a non-uniform cellular automata framework is proposed to solve this problem. This proposed scheme consists of confusion and diffusion steps. In confusion step, the positions of the original image pixels are replaced by chaos mapping. Key image is created using non-uniform cellular automata and then the hyper-chaotic mapping is used to select random numbers from the image key for encryption. The main contribution of the paper is the application of hyper chaotic functions and non-uniform CA for robust key image generation. Security analysis and experimental results show that the proposed method has a very large key space and is resistive against noise and attacks. The correlation between adjacent pixels in the encrypted image is reduced and the amount of entropy is equal to 7.9991 which is very close to 8 which is ideal.
•A non-uniform cellular automata (CA) framework is proposed for image encryption.•Non-uniform CA is able to produce long sequences of random numbers.•Key image is created using non-uniform cellular automata.•Hyper-chaotic mapping is used to select random numbers from the key image.•Experimental results show resistance of the approach against noise and attacks.
•Uses a chaotic transformation matrix to change pixel and values.•Recursive interlacing of pixel position and pixel value changes.•Very long periods compared to previous transformations.•Robust ...against brute-force and known-text attacks.•Applicable to any type of data, unlike most of the existing encryption methods.
We present a novel data encryption approach that utilizes a cascaded chaotic map application. The chaotic map used in both permutation and diffusion is Arnold’s Cat Map (ACM), where the transformation is periodic and the encrypted data can be recovered. The original format of ACM is a two-dimensional mapping, and therefore it is suitable to randomize the pixel locations in an image. Since the values of pixels stay intact during the transformation, the process cannot encrypt an image, and known-text attacks can be used to get back the transformation matrix. The proposed approach uses ACM to shuffle the positions and values of two-dimensional data in an interlaced and nested process. This combination extends the period of the transformation, which is significantly longer than the period of the initial transformation. Furthermore, the nested process's possible combinations vastly expand the key space. At the same time, the interlaced pixel and value transformation makes the encryption highly resistant to any known-text attacks. The encrypted data passes all random-data tests proposed by the National Institute of Standards and Technology. Any type of data, including ASCII text, can be encrypted so long as it can be rearranged into a two-dimensional format.
Differential evolution (DE) is a simple but powerful evolutionary algorithm used in multiple sciences and engineering disciplines to tackle optimization problems. DE has some disadvantages, such as ...premature convergence and the low convergence rate that prompts the worst DE execution structure in the constrained environment. The occurrence of these constraints split up the exploration area into viable and un-viable intervals. To overcome the abovementioned issues, we chose to take advantage of the vital characteristics of two mutation strategies: DE/rand/1 and DE/best/2. This research proposes a novel DE variant called Multi-population-based chaotic DE (MPC-DE) to solve multi-model and multi-objective optimization problems. The proposed MPC-DE is divided into two sub-populations with chaotic-based enhanced population initialization approaches, Sinusoidal and Tent map chaotic population initialization. Each sub-population follows the proposed improved mutation strategies based on two-dimensional chaotic maps, i.e., Baker’s map and Arnold’s Cat Map for DE/rand/1 in the first sub-population, and Zaslavskii Map for DE/best/2 in the second sub-population. Finally, the selection criteria are proposed to select the best offspring produced by each sub-population following the mutant vectors generated by the proposed mutation strategies. MPC-DE is evaluated on the dynamic multi-model and multi-objective optimization problems, i.e., benchmark problems for CEC 2017 and CEC 2020, respectively. To verify MPC-DE’s performance, we compare it with the latest DE variants, namely, EFADE, MPEDE, SHADE, EPSDE, L-SHADE, ESMDE, CoDE, and JADE. The proposed MPC-DE is also employed to solve the Economic Load Dispatch Problem (EDP) and reduce fuel costs. We used a 60-unit bus system and a 180-unit bus system to solve EDP and compared it to recent EDP solvers such as DPADE, JADE, EPSDE, SaDE, DE/BBO, DE, MIMO, TLBO, BPSO, CSO, ORCSA, CSA, ORCCRO, BBO, and ED-DE. The empirical results confirmed that MPC-DE outperformed other recent variants for multi-objective optimization problems and EDP.
This paper proposes a new block image encryption scheme based on hybrid chaotic maps and dynamic random growth technique. Since cat map is periodic and can be easily cracked by chosen plaintext ...attack, we use cat map in another securer way, which can completely eliminate the cyclical phenomenon and resist chosen plaintext attack. In the diffusion process, an intermediate parameter is calculated according to the image block. The intermediate parameter is used as the initial parameter of chaotic map to generate random data stream. In this way, the generated key streams are dependent on the plaintext image, which can resist the chosen plaintext attack. The experiment results prove that the proposed encryption algorithm is secure enough to be used in image transmission systems.
•We propose a new fast image encryption scheme by using improved cat map.•The dynamical growth technique is employed to enhance the security.•Pixel diffusion process depends on both the key and the plain-image.•The scheme can resist chosen-plaintext attacks.
Image encryption algorithms typically transform a plain image into a noise-like cipher image, whose appearance is an indication of encrypted content. Bao and Zhou Image encryption: Generating ...visually meaningful encrypted images, Information Sciences 324, 2015 propose encrypting the plain image into a visually meaningful cover image. This improves security by masking existence of encrypted content. Following their approach, we propose a lossless visually meaningful image encryption scheme which improves Bao and Zhou's algorithm by making the encrypted content, i.e. distortions to the cover image, more difficult to detect. Empirical results are presented to show high quality of the resulting images and high security of the proposed algorithm. Competence of the proposed scheme is further demonstrated by means of comparison with Bao and Zhou's scheme.
•We model a visual meaningful image encryption scheme based lift wavelet transformation.•The scheme transforms a secret image into a random-like image, and embeds it into a cover image.•The scheme is fast and efficient, and it shows satisfactory results against several common tests.•Compared with existing schemes, this scheme shows superior performance.
Chaotic dynamics is an important source for generating pseudorandom binary sequences (PRBS). Much efforts have been devoted to obtaining period distribution of the generalized discrete Arnold's Cat ...map in various domains using all kinds of theoretical methods, including Hensel's lifting approach. Diagonalizing the transform matrix of the map, this article gives the explicit formulation of any iteration of the generalized Cat map. Then, its real graph (cycle) structure in any binary arithmetic domain is disclosed. The subtle rules on how the cycles (itself and its distribution) change with the arithmetic precision <inline-formula><tex-math notation="LaTeX">e</tex-math> <mml:math><mml:mi>e</mml:mi></mml:math><inline-graphic xlink:href="li-ieq1-3051387.gif"/> </inline-formula> are elaborately investigated and proved. The regular and beautiful patterns of Cat map demonstrated in a computer adopting fixed-point arithmetics are rigorously proved and experimentally verified. The results can serve as a benchmark for studying the dynamics of the variants of the Cat map in any domain. In addition, the used methodology can be used to evaluate randomness of PRBS generated by iterating any other maps.
Color image can provide more information than gray image, so it is used more widely in the field of the communication. In recent years, how to safely encrypt images has received increasing attention. ...Numerous previous image encryption algorithms are based on the symmetric encryption algorithm, but each pair of users communicating with symmetric encryption algorithm can only use the key that others do not know, so when the sender communicates with a receiver multiple times or sends the message to multiple receivers, the key number will grow at a geometric rate, and key management will become a burden on the users. In this paper, we propose an asymmetric image encryption algorithm for the advantages that the key groups and the number of keys in secret information transmission among multiple people are very small, and key transmission mode is relatively simple and secure. In our algorithm, first, the plain image is compressed and then the color image is encrypted by using the improved 4D cat map followed by asymmetric encryption which is based on elliptic curve ElGamal encryption, and finally, the encrypted image is globally diffused. The performance analysis is performed on key spaces, key sensitivity, the capability of resisting statistical attacks, differential attacks, known plaintext attacks and chosen plaintext/ciphertext attacks and quality evaluation metrics of decrypted image. Simulation results show that the proposed algorithm has better security comparing with other algorithms.
PDF
