AFast Multiple Image Encryption Algorithm Based on Hilbert Curve and Chaotic Map
Mehmet Demirtaş · 2022 Innovations in Intelligent Systems and Applications Conference (ASYU) · 2022
In this paper, a fast multiple-image encryption technique is presented for gray-level images. The input images are scrambled using the Hilbert space-filling curve, column swapping, and row shifting. Following the scrambling stage, the images are subjected to a diffusion process. The 2D logistic map is used in the chaotic range to generate necessary parameters for both scrambling and diffusion phases. The suggested technique has a big keyspace and is sensitively dependent on the secret keys. The proposed technique can withstand cryptanalytic attacks such as exhaustive-search, differential, and statistical attacks, according to simulations of various performance criteria. The algorithm is also very fast in the sense that it can encrypt four 256 × 256 grayscale images in less than 0.17 seconds.