Proposed Image Encryption System Research Articles

High-quality visually secure image cryptosystem using improved Chebyshev map and 2D compressive sensing model

In this paper, we propose an improved Chebyshev map and a visually meaningful image encryption (VMIE) algorithm based on two-dimensional compressive sensing (2DCS). First, the adoption of 2DCS compresses the plain image, wherein the measurement matrix is processed by the simulated annealing algorithm to improve the quality of the reconstructed image. Second, a diffusion operation is performed on the sample data. Furthermore, a matrix encoding matrix is employed to insert the cryptographic image into the host image to obtain a visually meaningful steganographic image. The experimental results and comprehensive analyses show that the proposed scheme has feasible performance and stands up to various attacks. Eventually, the comparison with existing related schemes demonstrates that the proposed image encryption system has the advantages of visual security and reconstruction quality.

Novel and secure plaintext‐related image encryption algorithm based on compressive sensing and tent‐sine system

In this paper, a secure plaintext-related image encryption scheme based on compressive sensing and a tent-sine system is proposed. First, the discrete wavelet transform (DWT) is used to transform the plain image to get a coefficient matrix. Second, several chaotic sequences generated by the tent-sine chaotic map are used to scramble the coefficient matrix and construct a measurement matrix. Afterward, compressive sensing is performed on the coefficient matrix to obtain a small-sized encrypted image. Finally, an image encryption scheme related to plaintext is designed. In particular, the proposed system uses the original image information to participate in the encryption process, ensuring the high sensitivity of the cryptosystem to minor differences in the plain image and good performance on resisting known/selected plaintext attacks. Furthermore, to convey the plaintext-related parameters to the receiver, the dimension of the ciphertext image is expanded, and the parameters are embedded into the ciphertext image. Simulation results and security analysis show that the proposed image encryption system has strong plaintext sensitivity and robustness for effectively resisting various typical attacks such as brute-force attacks, statistical attacks, and differential attacks.

ROI Image Encryption using YOLO and Chaotic Systems

In this paper, we design a cellular automata (CA)-based ROI (region of interest) image encryption system that can effectively reduce computational cost and maintain an appropriate level of security. The proposed image encryption system obtains a cryptographic image through three steps. First, a region of interest with high importance is extracted from the entire image using deep learning. We use the YOLO (You Only Look Once) algorithm to extract the ROI from a given original image. Next, the detected ROI is encrypted using the Chen system, a chaotic-based function with high security. Finally, the execution time is effectively reduced by encrypting the entire image using a hardware-friendly CA. The safety of the proposed encryption system is verified through various statistical experiment results and analyses.

Image encryption based on Kronecker product over finite fields and DNA operation

This paper reports an image encryption algorithm based on a matrix of Kronecker products and a deoxyribonucleic acid (DNA) operation over finite fields. First, a plaintext image is mapped from pixel gray-levels to the finite field. Subsequently, the image pixels are scrambled and diffused simultaneously by the Kronecker-product matrix based on a permutation polynomial over finite fields. Finally, a DNA operation is carried out to obtain greater confusion and scrambling. A widespread of security analyses and experimental results show that the proposed algorithm is safe against several common attacks. Moreover, there were no rounding errors in computation over finite fields, thereby ensuring a strict lossless image encryption and decryption. Due to the intrinsic nonlinearity of the permutation polynomials in the finite field, the proposed image encryption system is nonlinear and can resist known-plaintext and chosen-plaintext attacks.

Impulsive synchronization of coupled delayed neural networks with actuator saturation and its application to image encryption

The actuator of any physical control systems is constrained by amplitude and energy, which causes the control systems to be inevitably affected by actuator saturation. In this paper, impulsive synchronization of coupled delayed neural networks with actuator saturation is presented. A new controller is designed to introduce actuator saturation term into impulsive controller. Based on sector nonlinearity model approach, impulsive controls with actuator saturation and with partial actuator saturation are studied, respectively, and some effective sufficient conditions are obtained. Numerical simulation is presented to verify the validity of the theoretical analysis results. Finally, the impulsive synchronization is applied to image encryption. The experimental results show that the proposed image encryption system has high security properties.

Parallelizable cipher of color image based on two-dimensional chaotic system

This paper aims to present a parallel implementation based color image encryption using non -linear chaotic system. The adopted chaotic system was suggested and approved in our previous work [1] which generates key streams with chaotic behavior. In this paper, pixel level permutation algorithm based on chaotic map generation is investigated and analyzed. The encryption–decryption schemes are achieved in parallel and composed of three main phases: chaotic keys generation, pixel-level permutation and bit-level diffusion phase. Both permutation and diffusion processes are achieved according to the chaotic keys. The parallel implementation of the proposed image encryption system is realized and inspired with parallel computing library offered by Matlab 2018, which equips highly performance than the pipeline ones and would be helpful to utilize in image encryption/decryption for real time application. Security and statistical analysis in addition to the main differential attacks analysis are specified to evaluate the performance of the proposed image encryption algorithm with parallel implementation. From the experimental results, the output image of the encryption task shows a higher randomness of the encrypted image which can be effectively resistant to attacker. Furthermore, the run time of encryption process is faster than other research works.

A Robust Image Encryption Algorithm Based on a 32-bit Chaotic System

In these years, image encryption systems based on chaotic maps have received considerable attention from researchers. For the security of encryption algorithms, it is important to ensure that chaotic systems can produce high quality pseudo-random sequences. However, when a chaotic system that theoretically has good random performance is deployed in a limited precision platform, its random performance will deteriorate. We prove that even if the precision reaches 256-bit, the piecewise linear chaotic map still fails to achieve the desired random performance. Moreover, in the case of low precision, the cascade structure commonly used in mixed chaotic maps will aggravate the problem of random degeneration. To generate good pseudo-random numbers in low-precision platforms, we propose a positive integer random sequence generator, called 32-bit PL_PWLCM&LM, which comprises two 32-bit PL_PWLCMs and one 32-bit logistic map in parallel. In our proposed image encryption system, we adopt the permutation algorithm with four pixels as a permutation unit and the diffusion algorithm based on rows and columns. The security and performance analyses prove that the proposed scheme is a secure, robust, and fast image encryption algorithm. Source codes are shared on GitHub: https://github.com/cuclihao/Pic_Enc_V3.

Image encryption based on permutation polynomials over finite fields

In this paper, we propose an image encryption algorithm based on a permutation polynomial over finite fields proposed by the authors. The proposed image encryption process consists of four stages: i) a mapping from pixel gray-levels into finite field, ii) a pre-scrambling of pixels’ positions based on the parameterized permutation polynomial, iii) a symmetric matrix transform over finite fields which completes the operation of diffusion and, iv) a post-scrambling based on the permutation polynomial with different parameters. The parameters used for the polynomial parameterization and for constructing the symmetric matrix are used as cipher keys. Theoretical analysis and simulation demonstrate that the proposed image encryption scheme is feasible with a high efficiency and a strong ability of resisting various common attacks. In addition, there are not any round-off errors in computation over finite fields, thus guaranteeing a strictly lossless image encryption. Due to the intrinsic nonlinearity of permutation polynomials in finite fields, the proposed image encryption system is nonlinear and can resist known-plaintext and chosen-plaintext attacks.

The Memorable Image Encryption Algorithm Based on Neuron-Like Scheme

A new image cryptosystem based on neuron-like scheme is proposed in this paper. As a non-linear component of image cryptosystem, neuron-like learning algorithm can realize a kind of memorable diffusion algorithm, thus realizing the plaintext-related image encryption algorithm. Through the feedback operation, the inputs and weights of the neuron are regulated by the information of the image, and then they are used to diffuse the image information. According to the needs of application scenarios, the number of inputs of the neuron can be adjusted so that the image cryptosystem can be applied to different security requirements. The simulation results show that the proposed image encryption system is extremely sensitive to the secret keys, the equivalent keys and the plain images, and also possesses the high security and adaptive characteristics. The image cryptosystem can be applied to the actual applications of image information security.

Optical Image Encryption System Using Several Tilted Planes

A well-known technique for optical image encryption is the double random phase encoding (DRPE) technique, which uses two random phase masks (RPMs), one RPM at the input plane of the encryption system and the other RPM at the Fourier plane of the optical system, in order to obtain the encrypted image. In this work, we propose to use tilted planes for the Fourier and the output planes of the optical DRPE encryption system with the purpose of adding two new security keys, which are the angles of the tilted planes. The optical diffraction on a tilted plane is computed using the angular spectrum of plane waves and the coordinate rotation in the Fourier domain. The tilted distributions at the intermediate and output planes of the optical DRPE encryption system are the second RPM and the encrypted image, respectively. The angles of the tilted planes allow improvement to the security of the encrypted image. We perform several numerical simulations with the purpose of demonstrating the validity and feasibility of the proposed image encryption system.

An improved image encryption algorithm for satellite applications

Encryption on-board Earth observation satellites aims to secure the amount of data transmitted to the ground station. During the last two decades, chaos-based encryption has reached an important achievement in securing data transfers. In this paper, an efficient image encryption method based on chaotic maps and the Advanced Encryption Standard (AES) is proposed for application on-board Earth observation satellites. The proposed method has many technical and attractive features, including a high security level and tolerance to Single Event Upsets (SEU). Performance results for the proposed image encryption system are evaluated and compared to recent works. Moreover, the proposed algorithm was implemented on a modern reconfigurable FPGA device (XILINX Artix-7 XC7A100T) to evaluate the resulting performance and resource utilization. The results show that a fast (1.75 Gbit/s) and a highly secure data encryption is achieved with low power consumption (1.37 W) and that the algorithm is robust, which makes it applicable on board Earth Observation Satellites (EOS). Beyond satellite images, the proposed algorithm is also better suited for the secure encryption of normal digital images.

A Novel Image Encryption Scheme Based on Clifford Attractor and Noisy Logistic Map for Secure Transferring Images in Navy

Cryptography is a science to maintain the security of the message by changing data or information into a different form, so the message cannot be recognized. Today, many algorithms have been proposed for image encryption, but the chaotic encryption methods have a good combination of speed and high security. In recent years, the chaos based cryptographic algorithms have suggested some new and efficient ways to develop secure image encryption techniques. The chaos-based encryption schemes are composed of two steps: chaotic confusion and pixel diffusion. In the chaotic confusion stage, a combination of the chaotic maps is used to realize the confusion of all pixels.In this paper, we first give a brief introduction into chaotic image encryption and then we investigate some important properties and behaviour of the logistic map. The logistic map, aperiodic trajectory, or random-like fluctuation, could not be obtained with some choice of initial condition. Therefore, a noisy logistic map with an additive system noise is introduced. The proposed scheme is based on the extended map of the Clifford strange attractor, where each dimension has a specific role in the encryption process. Two dimensions are used for pixel permutation and the third dimension is used for pixel diffusion. In order to optimize the Clifford encryption system we increase the space key by using the noisy logistic map and a novel encryption scheme based on the Clifford attractor and the noisy logistic map for secure transfer images is proposed. This algorithm consists of two parts: the noisy logistic map shuffle of the pixel position and the pixel value. We use times for shuffling the pixel position and value then we generate the new pixel position and value by the Clifford system. To illustrate the efficiency of the proposed scheme, various types of security analysis are tested. It can be concluded that the proposed image encryption system is a suitable choice for practical applications.

Image encryption based on Independent Component Analysis and Arnold’s Cat Map

Security of the multimedia data including image and video is one of the basic requirements for the telecommunications and computer networks. In this paper, a new efficient image encryption technique is presented. It is based on modifying the mixing matrix in Independent Component Analysis (ICA) using the chaotic Arnold’s Cat Map (ACM) for encryption. First, the mixing matrix is generated from the ACM by insert square image of any dimension. Second, the mixing process is implemented using the mixing matrix and the image sources the result is the encryption images that depend on the number of sources. Third, images decrypted using ICA algorithms. We use the Joint Approximate Diagonalization of Eigen-matrices (JADE) algorithm as a case study. The results of several experiments, PSNR, SDR and SSIM index tests compared with standard mixing matrix showed that the proposed image encryption system provided effective and safe way for image encryption.

A Chaotic System Based Image Encryption Algorithm using Plaintext-related Confusion

A new plaintext-related image encryption system based on the hyper-chaotic Lorenz system is proposed in this paper. In the proposed image encryption system, the hyper-chaotic Lorenz system is employed to generate six pseudo-random matrixes, where, two of them use the “add-modulus” operations to carry out the plaintext-unrelated image diffusion, and the other four matrixes are used to confuse the plaintext-related image. In the image confusion, each pixel will swap its location with another pixel, and the target location is determined by some elements in the plain image and the four matrixes. The proposed image encryption system can resist the chosen/known plaintext attacks due to the application of the plaintext-related image confusion in it. The simulation results show that the proposed encryption system also have the characters of fast encryption/decryption speed, large key space, strong key sensitivity, strong plaintext sensitivity, good statistical properties of cipher images, and large information entropy, etc. Thus, the proposed system can be used in practical communications.

Multiple Image Encryption System Based on Nematic Liquid Photonic Crystal Layers

A novel design for multiple symmetric image encryption system based on a phase encoding is presented. The proposed encryptor utilizes a photonic bandgap (PBG) block in order to ensure high reflectivity over a relatively wide frequency range of interest. Also, the proposed encryptor can be utilized to encrypt two images simultaneously through the use of two nematic liquid crystal (NLC) layers across the PBG block. The whole system has been simulated numerically using the rigorous finite difference time domain method. To describe the robustness of the encryption, a root mean square of error and the signal to noise ratio are calculated. The statistical analysis of the retrieved images shows that the proposed image encryption system provides an efficient and secure way for real time image encryption and transmission. In addition, as the proposed system offers a number of advantages over existing systems such as simple design, symmetry allowing integrated encryptor/decryptor system, ultra high bandwidth and encrypting two images at the same time, it can be suitably exploited in optical imaging system applications.