On the basis of ensuring the quality and concealment of steganographic images, this paper proposes a double-matrix decomposition image steganography scheme with multi-region coverage, to solve the problem of poor extraction ability of steganographic images under attack or interference. First of all, the cover image is transformed by multi-wavelet transform, and the hidden region covering multiple wavelet sub-bands is selected in the wavelet domain of the cover image to embed the secret information. After determining the hidden region, the hidden region is processed by Arnold transform, Hessenberg decomposition, and singular-value decomposition. Finally, the secret information is embedded into the cover image by embedding intensity factor. In order to ensure robustness, the hidden region selected in the wavelet domain is used as the input of Hessenberg matrix decomposition, and the robustness of the algorithm is further enhanced by Hessenberg matrix decomposition and singular-value decomposition. Experimental results show that the proposed method has excellent performance in concealment and quality of extracted secret images, and secret information is extracted from steganographic images attacked by various image processing attacks, which proves that the proposed method has good anti-attack ability under different attacks.
In response to the problems of high complexity and the large amount of operations of existing color image encryption algorithms, a low-complexity, low-operation color image encryption algorithm based on a combination of bit-plane and chaotic systems is proposed that is interrelated with plaintext information. Firstly, three channels of an RGB image are extracted, and the gray value of each pixel channel can be expressed by an eight-bit binary number. The higher- and lower-four bits of the binary gray value of each pixel are exchanged, and the position of each four-bit binary number is scrambled by a logistic chaotic sequence, and all the four-bit binary numbers are converted into hexadecimal numbers to reduce the computational complexity. Next, the position of the transformed image is scrambled by a logistic chaotic sequence. Then, the Chen chaos sequence is used to permute the gray pixel values of the permuted image. Finally, the gray value of the encrypted image is converted into a decimal number to form a single-channel encrypted image, and the three-channel encrypted image is synthesized into an encrypted color image. Through MATLAB simulation experiments, a security analysis of encryption effects in terms of a histogram, correlation, a differential attack, and information entropy is performed. The results show that the algorithm has a better encryption effect and is resistant to differential attacks.
To address the problems of the high complexity and low security of the existing image encryption algorithms, this paper proposes a dynamic key chaotic image encryption algorithm with low complexity and high security associated with plaintext. Firstly, the RGB components of the color image are read, and the RGB components are normalized to obtain the key that is closely related to the plaintext, and then the Arnold transform is used to stretch and fold the RGB components of the color image to change the position of the pixel points in space, so as to destroy the correlation between the adjacent pixel points of the image. Next, the generated sequences are independently encrypted with the Arnold-transformed RGB matrix. Finally, the three encrypted images are combined to obtain the final encrypted image. Since the key acquisition of this encryption algorithm is related to the plaintext, it is possible to achieve one key per image, so the key acquisition is dynamic. This encryption algorithm introduces chaotic mapping, so that the key space size is 10180. The key acquisition is closely related to the plaintext, which makes the ciphertext more random and resistant to differential attacks, and ensures that the ciphertext is more secure after encryption. The experiments show that the algorithm can encrypt the image effectively and can resist attack on the encrypted image.
Based on plaintext information, a dynamic chaotic color image encryption algorithm is proposed as a solution for the security problem in image data transmission, Comparatively, the existing one has the characteristics of high key acquisition complexity and low encryption speed. Firstly, normalize the RGB components of the images so as to obtain the dynamic key associated with the plaintext, which encrypts images with any shape by rearranging and combining pixels from the original image. Secondly, the parameter offset key is introduced as the initial parameter of the logistic map to generate a high-precision chaotic encryption sequence. The chaotic value sequence is stored for disordered pixels according to the image size, and enlarged and rounded to enhance the pixel value diffusion of the original image. Finally, RGB components are fully fused and uniformly distributed to form a completely encrypted image. According to the experimental results and security analysis, the proposed algorithm is effective against differential attacks, with low complexity, high efficiency, and faster encryption speed.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.