A HYBRID OF CHAOTIC MAPS WITH LYREBIRD OPTIMIZATION ALGORITHM FOR ENHANCING THE IMAGE ENCRYPTION MODEL

Chaotic maps have gained popularity in image encryption models due to their ability to secure images with a random key.Further, the randomness of the key is highly dependent on the initial parameter values of the chaotic map.Therefore, the literature employs metaheuristic algorithms to find the optimal parameter values for generating a completely random key.Two chaotic maps-the 1-D chaotic logistic map (CLM) and the chaotic tent map (CTM)-along with the metaheuristic algorithm known as one-to-one-based optimization (OOBO) were used to create an optimized image encryption (IE) model in this study.We utilize the 1-D CLM algorithm for random key generation, while the 1-D CTM algorithm generates the shuffling sequence for image shuffling.We use the metaheuristic OOBO algorithm in both chaotic maps to generate completely random keys and random shuffling sequences based on the objective function.In this research, we design the objective function using security parameters such as entropy (E) and correlation coefficient (CC).After determining the optimal parameter values for chaotic maps, we perform an exclusive-OR operation between the random key and the secret image.After that, shuffling of the secret image is done based on the shuffling sequence given by the 1-D CTM algorithm.We evaluate the proposed IE model through simulation using images from the primary and secondary datasets.Using various parameters, we compare the visual quality of the encrypted image with the secret image in this evaluation.The results illustrate that the proposed IE model outperforms in terms of entropy and correlation coefficients and provides better encryption than the existing IE models.The proposed model achieves an entropy of 7.99648 for the cameraman, 7.99688 for Elaine, and 7.99704 for the pepper image.Further, a correlation coefficient of 0.00021 for the cameraman, -0.00012 for Elaine, and -0.00161 for the pepper image.

Image encryption based on chaotic maps is an important method for ensuring the secure communication of digital multimedia on the Internet. To improve the encryption performance and security of image encryption systems, a new image encryption algorithm is proposed that employs a compound chaotic map and random cyclic shift. First, a new hybrid chaotic system is designed by coupling logistic, ICMIC, Tent, and Chebyshev (HLITC) maps. Comparison tests with previous chaotic maps in terms of chaotic trajectory, Lyapunov exponent, and approximate entropy illustrate that the new hybrid chaotic map has better chaotic performance. Then, the proposed HLITC chaotic system and spiral transformation are used to develop a new chaotic image encryption scheme using the double permutation strategy. The new HLITC chaotic system is used to generate key sequences used in the image scrambling and diffusion stages. The spiral transformation controlled by the chaotic sequence is used to scramble the pixels of the plaintext image, while the XOR operation based on a chaotic map is used for pixel diffusion. Extensive experiments on statistical analysis, key sensitivity, and key space analysis were conducted. Experimental results show that the proposed encryption scheme has good robustness against brute-force attacks, statistical attacks, and differential attacks and is more effective than many existing chaotic image encryption algorithms.

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.

This paper contrasts the implementation of several chaos-based digital image watermarking techniques in terms of imperceptibility, robustness, security and complexity. Most spatial and transform domains methods have been used namely Least Significant Bit (LSB), Discrete Cosine Transform (DCT), Discrete Wavelet Transform (DWT) and Redundant Discrete Wavelet Transform (RDWT) with Singular Value Decomposition (SVD) mathematical tool which has enhanced embedding capability. Both continuous and discrete chaotic maps namely Arnold's Chaotic Map (ACM), Logistic Chaotic map (LCM) and Lorenz Chaotic Map (LoCM) are included to result in secure schemes. Exhaustive series of tests have been performed along with a range of evaluation metrics for imperceptibility evaluation. In addition, Robustness of all the techniques has also been confirmed by applying a variety of attacks on the resulting images. This study will help to adopt the most suitable methods for a given application as sufficient number of test images have been utilized.

A novel image encryption scheme using both pixel level and bit level permutation with chaotic map

A simplified and efficient technique of cryptography of an image will be developed. The technique will utilize two simple rounds to apply image encryption and decryption, each round will be implemented by performing a simple rows shuffling and columns shuffling, eliminating the need for computational logical and arithmetic operations required for other techniques of image encryption. Our approach, while simplifying computational demands by eliminating complex arithmetic and logical operations, maintains robust security through the integration of dual Chaotic Logistic Map Models (CLMM) to generate highly sensitive indices keys. These indices keys control row and column shuffling, which provides a high degree of permutation and resists known-plaintext and cipher text-only attacks. The technique will require two secret indices keys, these keys will be variable in the length and the contents and they will depend on the image to be encrypted-decrypted, generation of these keys will be very easy and simple. The shuffling operations will be implemented using two secret indices keys, and by implementing couple of chaotic logistic map these keys will be produced using selected chaotic parameters values included in the private key. The technique uses a 256-bit private key, chaotic logistic maps, and high sensitivity to parameter variations to achieve "Very strong" key space entropy, with encryption throughput of 19,540 KB/s and robust performance across diverse image sizes. The generated decrypted image may become so sensitive to chosen of private key values, and any little variation in the private key through the decryption task, it will be showed as a hacking try. The proposed technique will be flexible, it will be used to process every image with any size (gray and/or color), and image changing will not require any updating in the decryption and encryption processes. The developed technique will be efficient; it will decrease both the encryption and decryption times, and it lead to accelerate the image encryption process comparing with other techniques. The study systematically utilizes specific evaluation metrics to substantiate claims regarding the quality, security, and velocity of the proposed cryptographic technique. Quality is assessed by Mean Square Error (MSE) and Peak Signal-to-Noise Ratio (PSNR) metrics

Image encryption algorithm based on the finite fields in chaotic maps

Chaos and compressive sensing based novel image encryption scheme

Communication is essential to every society, and securely exchanging data are critical in the age of digital data. The image has been the center of interest for security; chaotic maps image encryption become widely used in recent years. In our study, authors assessed the pixel rearrangement (permutation) and pixel dissemination (diffusion) stage used in cipher image established on designed scheme Pseudo-random number Generators (PRNGs) and Logistic chaotic map. Logistic maps used to generate seed value for PRNG and two-permutation stage and PRNGs used in diffusion operation. The proposed design through experimental tests demonstrate decent Statistical output, and high security for our image encryption schema, Our PRNGs passed NIST SP 800-22, and TestU01 practical randomness test suggests PRNGs have suitable statistical property.

High security has always been the ultimate goal of image encryption, and the closer the ciphertext image is to the true random number, the higher the security. Aiming at popular chaotic image encryption methods, particle swarm optimization (PSO) is studied to select the parameters and initial values of chaotic systems so that the chaotic sequence has higher entropy. Different from the other PSO-based image encryption methods, the proposed method takes the parameters and initial values of the chaotic system as particles instead of encrypted images, which makes it have lower complexity and therefore easier to be applied in real-time scenarios. To validate the optimization framework, this paper designs a new image encryption scheme. The algorithm mainly includes key selection, chaotic sequence preprocessing, block scrambling, expansion, confusion, and diffusion. The key is selected by PSO and brought into the chaotic map, and the generated chaotic sequence is preprocessed. Based on block theory, a new intrablock and interblock scrambling method is designed, which is combined with image expansion to encrypt the image. Subsequently, the confusion and diffusion framework is used as the last step of the encryption process, including row confusion diffusion and column confusion diffusion, which makes security go a step further. Several experimental tests manifest that the scenario has good encryption performance and higher security compared with some popular image encryption methods.

Multimedia security has become a serious issue in todaypsilas highly computerized and interconnected world. Pareek et al. recently proposed an image encryption scheme based on multiple 1D chaotic logistic maps. However, it has been shown in [8] that the proposed scheme is insecure against the chosen-plaintext attack and also has some other security defects. Here a modified scheme is propose based on a key dependent S-box and ciphertext feedback. The modified scheme efficiently fulfills the need of real-time image encryption, while at the same time it is secure against the differential and linear cryptanalysis.

In recent years, because of the frequent flow of digital images across the world over the transmission media, image encryption become one of the most substantial topics. In this paper, we propose a new image encryption method based on the well-known Chaotic Logistic Map (CLM) and the Rivest Cipher 4 (RC4) encryption methods. Here, we use the secret key, and the CLM to produce a one-dimensional array of different numbers. Then the RC4 algorithms used to make some sort of random shuffling (relying on the contents of the array created by the CLM) to the array that is created by the RC4 first algorithm. After that, the second algorithm of RC4 used inside a loop to change the value of each color (using the resultant array of the first RC4 algorithm) of a pixel until all the pixels of the image be changed. And by doing that we have produced a cipher image that is completely different and does not reveal any information of the plain image, also we proved that it is really a key sensitive encryption that can't be decrypted easily by using brute force or any other kind of attacks.

Image encryption scheme based on 3D baker with dynamical compound chaotic sequence cipher generator

The encrypted data play a valuable role in image processing applications especially during transmission. For fast and secure image encryption, chaotic maps are applied to improve image encryption efficiency as it is highly sensitive to system parameters initial values and has a large key space. This paper introduced a secure algorithm for images encryption and decryption by using chaotic Baker Map in the discrete Fourier transform (DFT). The proposed method employs baker map in the frequency domain to act on the transformed image coefficients which achieves high encryption efficiency. Simulation for statistical analysis using MATLAB are designed and tested. The achieved results demonstrated the superiority of the proposed approach with respect to encryption quality, statistical, information entropy, maximum deviation, and irregular deviation, differential, and noise immunity tests.

Chaotic maps used to shuffle and manipulate the image pixels are important for image encryption (IE). In this study, a novel 2D optimized chaotic map (OPMAP) using a triple-objective differential evolution (TODE) algorithm is presented for IE. A model for OPMAP with eight decision variables is empirically designed, and then its variables are determined utilizing TODE through minimizing a triple-objective function that involving Lyapunov exponent (LE), entropy and 0–1 test. OPMAP is assessed with respect to credible measurements like bifurcation, 3D phase space, LE, 0–1 test, permutation entropy (PE) and sample entropy (SE). The capability of OPMAP is then verified through an IE scheme including permutation and diffusion through various cryptanalyses: key space 2298, mean entropy 7.9995, mean correlation 13.61E-5, number of pixels changing rate (NPCR) 99.6093, unified average changing intensity (UACI) 33.4630 and encryption processing time (EPT) 0.2919 (s). A detailed review of IE schemes reported elsewhere is presented and IE performance of OPMAP is also validated by comparison with those IE schemes with and without optimization used. The 2D-OPMAP-based IE is faster and has low computational complexity. Moreover, the proposed it shows better cryptanalysis results for the most of the comparisons.