Chaos-based confusion and diffusion of image pixels using dynamic substitution

Qayyum, Abdullah and Ahmad, Jawad and Boulila, Wadii and Rubaiee, Saeed and Arshad, A and Masood, Fawad and Khan, Fawad and Buchanan, William J. (2020) Chaos-based confusion and diffusion of image pixels using dynamic substitution. IEEE Access, 8. pp. 140876-140895. ISSN 2169-3536

[img]
Preview
Text (Qayyum-etal-IEEE-Access-2020-Chaos-based-confusion-and-diffusion-of-image-pixels)
Qayyum_etal_IEEE_Access_2020_Chaos_based_confusion_and_diffusion_of_image_pixels.pdf
Final Published Version
License: Creative Commons Attribution 4.0 logo

Download (3MB)| Preview

    Abstract

    The evolution of wireless and mobile communication from 0G to the upcoming 5G gives rise to data sharing through the Internet. This data transfer via open public networks are susceptible to several types of attacks. Encryption is a method that can protect information from hackers and hence confidential data can be secured through a cryptosystem. Due to the increased number of cyber attacks, encryption has become an important component of modern-day communication. In this article, a new image encryption algorithm is presented using chaos theory and dynamic substitution. The proposed scheme is based on two-dimensional Henon, Ikeda chaotic maps, and substitution box (S-box) transformation. Through Henon, a random S-Box is selected and the image pixel is substituted randomly. To analyze security and robustness of the proposed algorithm, several security tests such as information entropy, histogram investigation, correlation analysis, energy, homogeneity, and mean square error are performed. The entropy values of the test images are greater than 7.99 and the key space of the proposed algorithm is 2 798 . Furthermore, the correlation values of the encrypted images using the proposed scheme are close to zero when compared with other conventional schemes. The number of pixel change rate (NPCR) and unified average change intensity (UACI) for the proposed scheme are higher than 99.50% and 33, respectively. The simulation results and comparison with the state-of-the-art algorithms prove the efficiency and security of the proposed scheme.