Image encryption using hybrid chaotic map

Abstract

Recently, great attention is paid to the use of chaotic maps in image encryption applications due to their excellent randomness properties. In this paper, an efficient image encryption algorithm using a set of chaotic maps has been proposed. The proposed algorithm consists of three stages: confusion, shuffling, and diffusion. In confusion stage, the original image is confused by using Arnold cat chaotic map. In shuffling stage, the pixels of the confused image are shuffled to add more randomness and unpredictability. Finally, the shuffled image is diffused by a key image generated by combining sequences generated from Henonand Logistic chaotic maps. To evaluate the performance, MATLAB Simulations are done for both the proposed algorithm and some existing algorithms in the literature while histogram, Number of Pixel Change Rate (NPCR), correlation, Unified Average Changing Intensity (UACI), and information entropy measures are used for security analysis. The simulation results and security analysis have demonstrated that the proposed encryption system is robust and flexible. For example the amount of entropy obtained by the proposed algorithm is 7.9975, which is very closed its ideal amount: 8, and NPCR is 99.66 %, which is also much closed to its ideal value: 100%.