An Efficient Image Privacy-Preserving Scheme Based On Mixed Chaotic Map and Compression

Abstract

In the digital modern era, multimedia security has turned into a major concern by the rapid growth of network technologies and digital communications. Accordingly, from the last few decades, the application of nonlinear dynamics and chaotic phenomena for multimedia data security earn significant attention. In this paper, an efficient image-encryption technique based on a two-dimensional (2D) chaotic system combine with the finite field of the specific order is introduced. The proposed scheme consists of four modules which are the separation of bits, compression, 2D chaotic map, and small S-boxes. Initially, the suggested scheme separates the pixels of the image into the least significant bits (LSB) and the most significant bits (MSB). Subsequently, the compression algorithm on these separated bits is applied and instantly transformed the MSB of the image into LSB. The key objective of the first module is to minimize the range of the pixel value up to eight times less than the original image, which consequently reduces the time complexity of the scheme. In the end, a 2D chaotic map is used to reshuffle the bytes to interrupt the internal correlation amongst the pixels of the image. At the tail end, the small S-boxes have been used to substitute the permuted image. The significance of small S-boxes plays a vital role to maintain the optimum security level, prevent computational effort, and reduced time complexity. The result of the suggested encryption system is tailor-made for instantaneous communication.