An image encryption algorithm based on multi-layered chaotic maps and its security analysis
Open accessThe DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Abstract
This study introduces a novel symmetric image encryption algorithm that employs a multi-layered architecture of chaotic maps, incorporating both confusion and diffusion components. The selected chaotic maps, namely Aizawa, Ricker, Sine-Circle, and Chirikov, have been well-established as effective sources of chaos in the existing literature. Within the proposed algorithm, these chaotic maps are strategically utilised in distinct layers to enhance the security of the encrypted image. The algorithm demonstrates applicability to real-world scenarios, distinguished by its simplicity, high-speed performance, and low computational complexity. The efficacy of the method is underlined by its dependence on both original images and secret keys, rendering it resilient against brute force and differential attacks. Rigorous experimentation, encompassing correlation, histogram analysis, NBCR, NPCR, UACI, PSNR, and NIST values, establishes the proposed encryption algorithm's robustness and security against diverse attack modalities, including differential and statistical approaches. These findings position the algorithm as a compelling solution for safeguarding sensitive information in various practical applications.
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
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
SOME 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 1×
“This key space is considerably larger than the 2 100 requirement proposed by Alvarez and Li (2006).”
Local Shannon entropy measure with statistical tests for image randomness
Wu, Y., Zhou, Y., Saveriades, G., Agaian, S., Noonan, J. P., & Natarajan, P. (2013) · Information Sciences · doi:10.1016/j.ins.2012.07.049 · Cited by 722 · cited 1×
“For an encrypted image to pass local entropy test, local entropy value must fall into the critical interval of (7.901515698, 7.903422936) determined by the significance value α = 0.001, k = 30, and T B = 1936 which corresponds to blocks of 44 × 44 pixels (Alawida, 2023; Wu et al., 2013).”
InfluentialImage encryption based on a combination of multiple chaotic maps
Elkandoz, M. T., & Alexan, W. (2022) · Multimedia Tools and Applications · doi:10.1007/s11042-022-12595-8 · Cited by 172 · cited 1×
“The main reason for this is that if the histogram is uniformly distributed, the probability of each of the grey scale values of the image is almost the same (Elkandoz & Alexan, 2022).”
A novel chaos-based permutation for image encryption
Alawida, M. (2023) · Journal of King Saud University - Computer and Information Sciences · doi:10.1016/j.jksuci.2023.101595 · Cited by 115 · cited 1×
“For an encrypted image to pass local entropy test, local entropy value must fall into the critical interval of (7.901515698, 7.903422936) determined by the significance value α = 0.001, k = 30, and T B = 1936 which corresponds to blocks of 44 × 44 pixels (Alawida, 2023; Wu et al., 2013).”
InfluentialA survey of image encryption algorithms based on chaotic system
Fang, P., Liu, H., Wu, C., & Liu, M. (2023) · The Visual Computer · doi:10.1007/s00371-022-02459-5 · Cited by 97 · cited 1×
“Works by Zhou et al. (2021), Lyle et al. (2022), and Fang et al. (2022) may be referred to for a very comprehensive and complete literature on chaos-based cryptography.”
An efficient image encryption scheme based on chaotic and Deoxyribonucleic acid sequencing
Alghafis, A., Firdousi, F., Khan, M., Batool, S. I., & Amin, M. (2020) · Mathematics and Computers in Simulation · doi:10.1016/j.matcom.2020.05.016 · Cited by 93
Secure Image Encryption Using Chaotic, Hybrid Chaotic and Block Cipher Approach
Chaudhary, N., Shahi, T. B., & Neupane, A. (2022) · Journal of Imaging · doi:10.3390/jimaging8060167 · Cited by 56 · cited 1×
“UACI is represented by Equation (25) (Chaudhary et al., 2022). where I 1 and I 2 represent the encrypted images before and after changing a pixel value, and M and N represent the width and height of the image, respectively.”
A novel chaotic image cryptosystem based on DNA sequence operations and single neuron model
Ben Slimane, N., Aouf, N., Bouallegue, K., & Machhout, M. (2018) · Multimedia Tools and Applications · doi:10.1007/s11042-018-6145-8 · Cited by 51
Cited by
Fast Color Image Encryption Algorithm Based on DNA Coding and Multi-Chaotic Systems
Wang, S., Pan, J., Cui, Y., Chen, Z., & Zhan, W. (2024) · Mathematics · doi:10.3390/math12203297 · Cited by 28
Mallick, B., Parida, P., Nayak, C., Ali, N., Panda, M. K., Prasad, B., Sahu, G., & Palai, G. (2025) · Alexandria Engineering Journal · doi:10.1016/j.aej.2025.02.113 · Cited by 20
Image encryption scheme using a new 4-D chaotic system with a cosinoidal nonlinear term in WMSNs
Fan, F., Verma, V., Long, G., Tsafack, N., & Jiang, D. (2024) · Physica Scripta · doi:10.1088/1402-4896/ad3698 · Cited by 20
Metadata
- Authors
- Güvenoğlu, E.
- Venue
- Connection Science
- Publisher
- Informa UK Limited
- Published
- 2024-02-03
- Volume
- 36
- Issue
- 1
- ISSN
- 0954-0091 (ISSN-L)
- 1360-0494
- OpenAlex
- W4391507935
- Cited by
- 39
- References
- 8
- FWCI
- 5.51
- Type
- journal article
- Language
- en
- Open access
- gold
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: An image encryption algorithm based on multi-layered chaotic maps and its security analysis. https://app.cochat.ai/papers/10.1080/09540091.2024.2312108
- The paper
- Güvenoğlu, E. (2024). An image encryption algorithm based on multi-layered chaotic maps and its security analysis. Connection Science. https://doi.org/10.1080/09540091.2024.2312108
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.