Reversible Data Hiding in a Chaotic Encryption Domain Based on Odevity Verification

On the premise of guaranteeing the visual effect, in order to improve the security of the image containing digital watermarking and restore the carrier image without distortion, reversible data hiding in chaotic encryption domain based on odevity verification was proposed. The original image was scrambled and encrypted by Henon mapping, and the redundancy between the pixels of the encrypted image was lost. Then, the embedding capacity of watermarking can be improved by using odevity verification, and the embedding location of watermarking can be randomly selected by using logistic mapping. When extracting the watermarking, the embedded data was judged according to the odevity of the pixel value of the embedding position of the watermarking, and the carrier image was restored nondestructively by odevity check image. The experimental results show that the peak signal-to-noise ratio (PSNR) of the original image is above 53 decibels after the image is decrypted and restored after embedding the watermarking in the encrypted domain, and the invisibility is good.

Reversible data hiding in chaotic encryption domain based on odevity verification

On the premise of guaranteeing the visual effect, in order to improve the security of the image containing digital watermarking and restore the carrier image without distortion, reversible data hiding in chaotic encryption domain based on odevity verification was proposed. The original image was scrambled and encrypted by Henon mapping, and the redundancy between the pixels of the encrypted image was lost. Then, the embedding capacity of watermarking can be improved by using odevity verification, and the embedding location of watermarking can be randomly selected by using logistic mapping. When extracting the watermarking, the embedded data was judged according to the odevity of the pixel value of the embedding position of the watermarking, and the carrier image was restored nondestructively by odevity check image. The experimental results show that the peak signal-to-noise ratio (PSNR) of the original image is above 53 decibels after the image is decrypted and restored after embedding the watermarking in the encrypted domain, and the invisibility is good.

A Color Image Encryption Scheme Based on a Novel 3D Chaotic Mapping

Low-dimensional chaotic mappings are simple functions that have low computation cost and are easy to realize, but applying them in a cryptographic algorithm will lead to security vulnerabilities. To overcome this shortcoming, this paper proposes the coupled chaotic system, which coupled the piecewise and Henon mapping. Simulation results indicate that the novel mapping has better complexity and initial sensitivity and larger key space compared with the original mapping. Then, a new color image encryption algorithm is proposed based on the new chaotic mapping. The algorithm has two processes: diffusion and confusion. In this scheme, the key is more than 2 216 , and SSIM and PSNR are 0.009675 and 8.6767, respectively. The secret key is applied in the shuffling and diffusion. Security analysis indicates that the proposed scheme can resist cryptanalytic attacks. It has superior performance and has high security.

Synchronization of Generalized Using to Image Encryption

The problem of the secure transmission of digital image has paid more and more attention to the network and this paper designs a special image encryption scheme. Image encryption scheme is designed based on the hyper chaos of generalized five-order Henon mapping and five-order cellular neural network (CNN) system. Firstly, the chaotic sequence [Formula: see text], which is regarded as the initial conditions of CNN system, is generated by the five-order generalized Henon mapping. Then another chaotic sequence [Formula: see text] is produced by the CNN system. At last, the cipher image is generated by the transformation of random sequence [Formula: see text] and the original image. Toward the end, the paper makes the simulation experiment and draws a conclusion that the algorithm of image encryption has strong attack resistance, good safety, and suitable to spread in the network through analyzing the statistical characteristics of the image information entropy, correlation and histogram as well as the key space and the sensitivity.