Open Access
ARTICLE
Image Encryption Using Multi-Scroll Attractor and Chaotic Logistic Map
Department of Electronics & Communication Engineering, B. S. Abdur Rahman Crescent Institute of Science & Technology, Chennai, 600045, Tamilnadu, India
* Corresponding Author: R. Anitha. Email:
Computers, Materials & Continua 2022, 72(2), 3447-3463. https://doi.org/10.32604/cmc.2022.021519
Received 05 July 2021; Accepted 24 December 2021; Issue published 29 March 2022
Abstract
In the current scenario, data transmission over the network is a challenging task as there is a need for protecting sensitive data. Traditional encryption schemes are less sensitive and less complex thus prone to attacks during transmission. It has been observed that an encryption scheme using chaotic theory is more promising due to its non-linear and unpredictable behavior. Hence, proposed a novel hybrid image encryption scheme with multi-scroll attractors and quantum chaos logistic maps (MSA-QCLM). The image data is classified as inter-bits and intra-bits which are permutated separately using multi scroll attractor & quantum logistic maps to generate random keys. To increase the encryption efficiency, a hybrid chaotic technique was performed. Experimentation is performed in a Qiskit simulation tool for various image sets. The simulation results and theoretical analysis show that the proposed method is more efficient than its classical counterpart, and its security is verified by the statistical analysis, keys sensitivity, and keyspace analysis. The Number of changing pixel rate (NPCR) & the Unified averaged changed intensity (UACI) values were observed to be 99.6% & 33.4% respectively. Also, entropy oscillates from 7.9 to 7.901 for the different tested encrypted images. The proposed algorithm can resist brute force attacks well, owing to the values of information entropy near the theoretical value of 8. The proposed algorithm has also passed the NIST test (Frequency Monobit test, Run test and DFT test).Keywords
Cite This Article
This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.