A compressive sensing encryption scheme for dual color images based on discrete memristor map and Rubik’s cube scramble

Abstract

The most common in practical image encryption are multiple color images, however, less attention is paid to inter-layer correlation broken in existing color image encryption algorithms. In this paper, a 2-D compressive sensing dual color images encryption algorithm based on a discrete memristor hyper-chaotic map and Rubik's cube scramble is proposed. First, we propose a new discrete memristor-Ikeda map (DM-Ikeda), the analysis result shows the DM-Ikeda map has extremely high complexity and hyper-chaotic dynamical behavior. Second, to facilitate ciphertext transmission, the images are compressed and encrypted simultaneously by DM-Ikeda map and 2D compressive sensing. Then, we design a new rubik's cube scramble algorithm, which combines the layers of two images into a cube that can be expanded in different orders, and swaps the pixels of rows, columns or faces of each image by rotating the cube to achieve image scramble. This algorithm can break the correlation not only of pixels within layers of two images but also of pixels between different layers of images. Finally, two images are further diffused with the use of hyper-chaotic sequences. The algorithm can achieve both compression and encryption of dual color images. Experimental results indicate that, our scheme has excellent compression, and can break the correlation between different images and layers, which is excellent resistance to statistical attacks and has high security.