Image Encryption Scheme Based on a Generalized Arnold Map and RSA Algorithm

This research proposes a new image encryption scheme based on Lorenz hyperchaotic system and Rivest–Shamir–Adleman (RSA) algorithm. Firstly, the initial values of the Lorenz hyperchaotic system are generated by RSA algorithm, and the key stream is produced iteratively. In order to change the position and gray value of the pixel, the image data are hidden by additive mode diffusion. Secondly, the diffusion image matrix is reshaped into a one-dimensional image matrix, which is confused without repetition to hide the image data again. Then, the finite field diffusion algorithm is executed to realize the third hiding of the image information. In order to diffuse the pixel information into the entire cipher image, the additive mode diffusion algorithm needs to be looped twice. Finally, the cipher image can be obtained. The experimental results prove that the image encryption scheme proposed in this research is effective and has strong antiattack and key sensitivity. Moreover, the security of this encryption scheme relies on the RSA algorithm, which has high security.

Section: Related Workmentioning

confidence: 99%

An Image Encryption Scheme Based on Lorenz Hyperchaotic System and RSA Algorithm

Lin

2021

“…Reference [21] Reference [36] Reference [37] Reference [38] Figure 8: e bar chart of the PSNR. [11] 99.60 33.48 Reference [17] 99.6395 33.3992…”

Section: Oursmentioning

confidence: 99%

“…e encryption system can be symmetric [11,12] or asymmetric [13][14][15][16][17][18][19][20]. For a symmetric encryption system, the encryption and decryption processes use the same key that requires the transmission channel to be as safe as possible during the key transmission process.…”

Section: Introductionmentioning

confidence: 99%

Visually Meaningful Image Encryption Scheme Based on DWT and Schur Decomposition

Dong

Huang

2021

Self Cite

A visually meaningful image encryption scheme with an asymmetric structure based on the discrete wavelet transform (DWT) and Schur decomposition is proposed in this study. First, the RSA algorithm is used to generate the initial values for the chaotic system to produce the random sequence. Then, both scrambling and diffusion operations are performed on the plain image to obtain the preencrypted image. Moreover, the Schur decomposition is applied on the preencrypted plain image to obtain the upper triangular and orthogonal matrices. Second, the cover image is scrambled followed by a DWT operation. Four subbands are then formed, namely, LL, HL, LH, and HH. Finally, the former upper triangular matrix and orthogonal matrix are embedded into subbands LH and HH produced by the cover image. After the application of the inverse DWT and inverse scrambling operation, the final visually meaningful cover image embedded with a secret plain image can be obtained. No one can identify any useful information about the plain image from the final embedded cover image, nor can anybody know that there is any hidden secret image. Experimental simulations show that the normalized correlation values between the original cover image and the final visually meaningful cover image are approximately 0.9997. Therefore, the proposed encryption scheme is imperceptible for secret image communications.

“…e new chaotic system has good chaotic behavior, and the distribution of chaotic sequences is uniform. Image encryption was also realized by combining the Arnold map and the Rivest-Shamir-Adleman (RSA) algorithm [4]. First, the initial value of the Arnold map is generated by the RSA algorithm followed by the XOR diffusion operation.…”

Section: Introductionmentioning

confidence: 99%

Self-Adaptive Image Encryption Algorithm Based on Quantum Logistic Map

Dong

Huang

Mei

et al. 2021

Self Cite

This study proposes a self-adaptive image encryption algorithm based on the quantum logistic map. First, the initial values are substituted into the quantum logistic map based on an iteration process to generate three random sequences. After preprocessing, three new random sequences with better randomicity were obtained from the generated random sequences. In particular, the correlation coefficients for random sequences before and after preprocessing are compared to determine the best model to make the correlation coefficients closer to zero. Second, one random sequence in the scrambling stage is selected with respect to the plain image. The selected random sequence is then used to perform row-column perturbation on the plain image. Finally, the remaining two random sequences are used to perform forward and reverse diffusion to obtain the final cipher image. Because of the dependence on the plain image, the algorithm can frustrate the chosen-plaintext and known-plaintext attacks. Experimental results show that the proposed encryption algorithm can achieve secure communications.