Chaos-Based Confusion and Diffusion of Image Pixels Using Dynamic Substitution
Open accessThe DOI matches its Crossref record; 67 of the 67 references it cites were found in a registry or an index.
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 2798. 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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Figures






![TABLE 3. Hussain's S-box [53].](https://figures.cochat.ai/paper-figures/4ebfc0b5fd0048759e6fa37f8ae40f3b/chaos-based-confusion-and-diffusion-of-image-pixels-using-dynamic-substitution-figure-7.png)

























Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
1 retracted
Khan, M., & Asghar, Z. (2018) · Neural Computing and Applications · doi:10.1007/s00521-016-2511-5 · Cited by 184 · cited 1×
“The most important ones are as follows [47]: This parameter is often referred as the butterfly effect .”
BackgroundRetractedCommunication Theory of Secrecy Systems
Shannon, C. E. (1949) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1949.tb00928.x · Cited by 9,440 · cited 1×
“It was Claude Elwood Shannon who in 1949 gave this notion of information entropy [60].”
BackgroundSOME BASIC CRYPTOGRAPHIC REQUIREMENTS FOR CHAOS-BASED CRYPTOSYSTEMS
ALVAREZ, G., & LI, S. (2006) · International Journal of Bifurcation and Chaos · doi:10.1142/s0218127406015970 · Cited by 2,119 · cited 2×
“Some important properties that chaotic systems exhibits are topology mixing, strange attractor, ergodicity, randomness and reliance on their initial conditions [23], [29], [45], [46].”
BackgroundMethodA symmetric image encryption scheme based on 3D chaotic cat maps
Chen, G., Mao, Y., & Chui, C. K. (2004) · Chaos, Solitons & Fractals · doi:10.1016/j.chaos.2003.12.022 · Cited by 2,092 · cited 1×
“With the help of chaos theory and cryptography, efficient encryption schemes can be designed [9], [14], [23]–[25].”
BackgroundSymmetric Ciphers Based on Two-Dimensional Chaotic Maps
Fridrich, J. (1998) · International Journal of Bifurcation and Chaos · doi:10.1142/s021812749800098x · Cited by 1,917 · cited 1×
“For encryption and permutation, a 2D baker map is applied for M × M image and the relationship of cryptography and discreet chaos is analyzed [30].”
MethodChaos and Nonlinear Dynamics: An Introduction for Scientists and Engineers
Hilborn, R. C. (2000) · doi:10.1093/acprof:oso/9780198507239.001.0001 · Cited by 1,373
Ikeda, K. (1979) · Optics Communications · doi:10.1016/0030-4018(79)90090-7 · Cited by 1,218 · cited 1×
“The Ikeda map is a two-dimensional discreet-time complex map with good chaotic behaviour [49].”
BackgroundON THE DERIVATION OF A “CHAOTIC” ENCRYPTION ALGORITHM
Matthews, R. (1989) · Cryptologia · doi:10.1080/0161-118991863745 · Cited by 1,044 · cited 2×
“Some important properties that chaotic systems exhibits are topology mixing, strange attractor, ergodicity, randomness and reliance on their initial conditions [23], [29], [45], [46].”
BackgroundMethodChaos and nonlinear dynamics: an introduction for scientists and engineers
(1994) · Choice Reviews Online · doi:10.5860/choice.32-0359 · Cited by 913
Chaos-based cryptography: a brief overview
Kocarev, L. (2001) · IEEE Circuits and Systems Magazine · doi:10.1109/7384.963463 · Cited by 901 · cited 1×
“In the last few decades, a strong association between chaos and cryptography has been uncovered [20], [21].”
Background
Research works printed but not linked: 3
- ahmad, 2010, Efficiency analysis and security evaluation of image encryption schemes, Comput, 23, 25
- hussain, 2011, Some analysis of S-box based on residue of prime number, Proc Pak Acad Sci J, 48, 111
- hussain, 2010, Graphical strict avalanche criterion for kasumi s-box, Can J Comput Math Nat Sci Eng Med, 1, 132
Cited by
Items 101–111 of 111
Hajjaji, M. A., & Albouchi, A. (2024) · Journal of Electronic Imaging · doi:10.1117/1.jei.33.1.011004
Shnaen, H. J., & Mehdi, S. A. A. (2024) · Communications in computer and information science · doi:10.1007/978-3-031-62814-6_7
Image Encryption Using A Novel Orbital-Extraction Permutation Technique and Chaotic Key Generation
Khan, S., Ullah, S., Ahmad, J. E., Ullah, A., Ali, A., & Khan, M. S. (2024) · International Conference on Advanced Technologies for Signal and Image Processing · doi:10.1109/atsip62566.2024.10639043
“For a permutation scheme to be effective, apart from being highly secure it should also be lightweight [9-11].”
BackgroundSelf-citationBatool, F., Kureshi, N. I., Marie, R. R., Ahmad, F., Khan, M. S., Lemoudden, M., Buchanan, W. J., & Ahmad, J. E. (2025) · Communications in computer and information science · doi:10.1007/978-3-031-82153-0_20
Self-citationSecure Data Hiding with Chaotic Maps
Abd, A. S., Al-Thahab, O. Q. J., & Hamad, A. A. (2024) · International Conference on Advances in Engineering Science and Technology (AEST) · doi:10.1109/aest63017.2024.10959873
“This A. Qayyum et al. [11] focuses on Dynamic Substitution Bins (DSB) that utilizing logistic chaos maps for image encoding.”
Block lightweight encryption scheme for securing internet of things data and information
Oladipupo, E. T., OLAYEMI, D. O., Abikoye, O. C., Adeniyi, A. E., Aroba, O. J., & Awotunde, J. B. (2026) · Systems and Soft Computing · doi:10.1016/j.sasc.2026.200448
A Chaos-Based Technique with Reversible Data Hiding for Enhanced Security of Medical Data
Yaswanth, S., Anushiadevi, R., Sivaraman, R., & Venkatesh, V. (2026) · Communications in computer and information science · doi:10.1007/978-3-032-16038-6_18
Lightweight IOT-friendly image encryption scheme based on Latin square and dynamic DNA coding
Jassim, S. A., Al-Rahman, S. Q. A., & Nafea, A. A. (2026) · Engineering and Applied Science Research · doi:10.64960/easr.2026.263754
Hybrid Image Encryption Using 2D Henon Chaotic Map and Evolutionary Algorithm
Kumar, S., & Sharma, D. (2026) · Springer proceedings in mathematics & statistics · doi:10.1007/978-981-95-5891-9_21
Khan, M., & Ishaque, I. (2026) · Chaos Theory and Applications · doi:10.51537/chaos.1900590
Securing Image Encryption via a Hybrid Chaos-PQC Scheme Utilizing ML-KEM and Multi-Chaos
Furqan, H., Farida, Y., Fradana, A. U., & Fauzan, A. A. (2026) · International Conference on Information Technology and Computing (ICITCOM) · doi:10.1109/icitcom70739.2026.11714398
“NPCR measures the percentage of differing pixels and UACI the mean intensity difference, with ideal values of 99.6094% and 33.4635% for 8-bit grayscale images [20].”
Influential
Metadata
- Authors
- Qayyum, A., Ahmad, J., Boulila, W., Rubaiee, S., Arshad, Masood, F., Khan, F., & Buchanan, W. J.
- Affiliations
- University of Engineering and Technology Peshawar (PK)
- Edinburgh Napier University (GB)
- Taibah University (SA)
- University of Jeddah (SA)
- Institute of Space Technology (PK)
- National University of Sciences and Technology (PK)
- ORCID
- Venue
- IEEE Access
- Published
- 2020
- Volume
- 8
- Pages
- 140876-140895
- ISSN
- 2169-3536 (ISSN-L)
- OpenAlex
- W3046088399
- Cited by
- 111
- References
- 67
- Citations by year
- 2026: 9 · 2025: 13 · 2024: 19 · 2023: 23 · 2022: 21 · 2021: 20 · 2020: 6
- FWCI
- 6.81
- Type
- journal article
- Language
- en
- Open access
- gold
- doi.org
- Locations
- IEEE Access (publishedVersion, cc-by)
- Research Output (Edinburgh Napier University) (publishedVersion, other-oa)
- Strathprints: The University of Strathclyde institutional repository (University of Strathclyde) (acceptedVersion)
- ResearchOnline (Glasgow Caledonian University) (acceptedVersion, other-oa)
- DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
- Edinburgh Napier Research Repository (Edinburgh Napier University) (submittedVersion, cc-by)
- Topics
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Chaos-based Image/Signal Encryption
- Physical Sciences › Computer Science › Artificial Intelligence › Computer Science and Engineering
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Advanced Steganography and Watermarking Techniques
- Keywords
- image encryption, chaos-based cryptography, Henon map, Ikeda map, substitution boxes, key space analysis, NPCR and UACI, Shannon entropy, correlation analysis, secure data transmission
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.