The DOI matches its Crossref record; 66 of the 66 references it cites were found in a registry or an index; 12 of the 37 sources its claims cite were checked for support.
Image Encryption Algorithms: A Survey of Design and Evaluation Metrics
Open accessAbstract
Ensuring confidentiality and privacy is critical when it comes to sharing images over unsecured networks such as the internet. Since widely used and secure encryption methods, such as AES, Twofish, and RSA, are not suitable for real-time image encryption due to their slow encryption speeds and high computational requirements, researchers have proposed specialized algorithms for image encryption. This paper provides an introduction and overview of the image encryption algorithms and metrics used, aiming to evaluate them and help researchers and practitioners starting in this field obtain adequate information to understand the current state of image encryption algorithms. This paper classifies image encryption into seven different approaches based on the techniques used and analyzes the strengths and weaknesses of each approach. Furthermore, this paper provides a detailed review of a comprehensive set of security, quality, and efficiency evaluation metrics for image encryption algorithms, and provides upper and lower bounds for these evaluation metrics. Finally, this paper discusses the pros and cons of different image encryption approaches as well as the suitability of different image encryption approaches for different applications.
Overview
CoChat Summary
TL;DR
This survey reviews image encryption algorithms, classifying them into seven technique-based approaches and summarizing security, quality, and efficiency evaluation metrics. It also derives upper/lower bounds for many metrics and discusses strengths, weaknesses, and application suitability.
Key findings
- The paper classifies image encryption into seven approaches: traditional ciphers, chaotic systems, DNA encoding, neural networks, compressive sensing, frequency domain, and meaningful encryption; it summarizes trade-offs such as traditional ciphers being secure/standardized but computationally heavy and unable to correctly decrypt corrupted cipher images, while chaotic systems are fast and low-complexity but can have limited chaotic ranges.
- It reports ideal/reference values for evaluation metrics: entropy ideal = 8; NPCR ideal ≥99.6094%; UACI ideal ≥33.4635%; key space should be >2^100; MSE maximum = 65,025; MAE maximum = 255; D_uniform maximum = 1.9921875; chi-square critical value = 293.24 at α = 0.05.
- It provides upper limits for histogram metrics for different image sizes, e.g., irregular deviation upper limit 32,640 for 128×128, 130,560 for 256×256, 522,240 for 512×512, and 2,088,960 for 1024×1024; maximum deviation upper limit 8192, 32,768, 262,144, and 524,288 for those sizes.
- It discusses application suitability: chaotic-based encryption for resource-constrained IoT/edge devices; DNA-based for long-term secure archiving and potential espionage; compressive sensing for bandwidth-constrained embedded cameras/drones; meaningful encryption for covert communication.
Methods
- Design: a comprehensive literature survey/review, not an experimental study; it categorizes image encryption algorithms into seven approaches based on techniques used and reviews evaluation metrics.
- Data/sample: no primary dataset or new algorithm; it synthesizes published image encryption algorithms and metrics from cited literature.
- Analysis: narrative synthesis plus mathematical derivation of metric bounds (e.g., entropy, chi-square, maximum/irregular deviation, MSE, MAE, PSNR, NPCR, UACI, GLCM, key space/sensitivity, NIST SP 800-22) and discussion of strengths, weaknesses, and applications.
Limitations
- The paper states it is not an exhaustive list of all image encryption algorithms; future work includes exploring optical and quantum image encryption, conducting security and complexity analyses, and developing newer evaluation metrics.
- The paper states there is a pressing need for rigorous security analysis and standardized evaluation metrics, and that robustness against novel attacks such as adversarial machine learning and quantum computing needs consideration.
- Evident from the text: as a survey, it does not provide primary experimental benchmarking or standardized comparative results across algorithms; some provided sections are fragmented/duplicated, and no new encryption algorithm is proposed.
Model-written summary. Check it against the paper before relying on it.
Integrity signals
Registry
Cites
Statistics
Figures





Verification
Claims the paper makes
10 Valid · 3 Not valid · 23 Not checked · 77 Own results and interpretations
The cited sources support only part of this claim — read each source’s verdict below.
In the paper
“Yet the decryption process requires additional DNA rule tables to be transmitted along with the encrypted image [34].”
§ Image Encryption Algorithms: A Survey of Design and Evaluation Metrics > 2.3. DNA Encoding
What the sources say
- Partly supportedcites [34] Uddin, 2021, A novel DNA-based key scrambling technique for image encryption, Complex Intell. Syst. sourceExperimental — accuracy not yet measured
The Introduction (page not specified) says that most DNA-based methods discussed use map-based encryption and require an additional table to be sent to the receiver for decoding. It does not identify those tables as DNA rule tables or say that all DNA encoding-based encryption requires them; the Conclusion says the authors' own approach reduces that transmission burden. (LLM, conf=0.88)
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Partly supported
The cited sources support only part of this claim — read each source’s verdict below.
In the paper
“A robust and secure algorithm should produce two completely different cipher images when encrypted by two keys that are different by only one bit.”
§ Image Encryption Algorithms: A Survey of Design and Evaluation Metrics > 3.9. Key Space and Key Sensitivity
What the sources say
- Partly supportedcites [65] Himthani, 2022, Systematic Survey on Visually Meaningful Image Encryption Techniques, IEEE Access sourceExperimental — accuracy not yet measured
The “Key Sensitivity Analysis” section says that a small key modification may create completely different results, supporting the general principle. It does not specify a one-bit difference or require two completely different cipher images; its stated test is whether a slightly changed key prevents recovery of the original image. (LLM, conf=0.83)
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Partly supported
Every source the paper cites for this claim was checked and supports it.
In the paper
“To ensure a stronger level of security against brute force attacks, the key space of an image encryption algorithm should be larger than 2 100 [64].”
§ Image Encryption Algorithms: A Survey of Design and Evaluation Metrics > 3.9. Key Space and Key Sensitivity
What the sources say
- Supportedcites [64] Alvarez, 2006, Some basic cryptographic requirements for chaos-based cryptosystems, Int. J. Bifurc. Chaos source
Section 4.4 (p. 10) explicitly states Rule 13: the key space should exceed 2^100 to prevent brute-force attacks. The rule applies to ciphers generally, including an image-encryption algorithm, although a large key space alone does not guarantee security. (LLM, conf=0.94)
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Supported
Every source the paper cites for this claim was checked and supports it.
In the paper
“Furthermore, it should not be able to decrypt a cipher image and retrieve the plaintext image with a key that has one bit altered [65].”
§ Image Encryption Algorithms: A Survey of Design and Evaluation Metrics > 3.9. Key Space and Key Sensitivity
What the sources say
- Supportedcites [65] Himthani, 2022, Systematic Survey on Visually Meaningful Image Encryption Techniques, IEEE Access source
The Key Sensitivity Analysis section says an algorithm has good key sensitivity when the original image cannot be recovered after even a slight change in the key. Altering one bit is a slight change, so the passage supports the claim. No page number is available in our copy. (LLM, conf=0.90)
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Supported
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The Baker map is known to be vulnerable to chosen-plaintext attacks, where an attacker with a pair of plaintexts and corresponding ciphertexts can reverse the permutation and diffusion processes to deduce information about the secret key.”
§ Image Encryption Algorithms: A Survey of Design and Evaluation Metrics > 2.2.2. Baker Map
boostedstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
32 more claims
Create a free account to see all 113 claims and to verify the 7 references still open.
- Probably not a substantial claim. 64
- It may state two separate claims as one. 29
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
Each contradiction between two passages listed here was confirmed by an independent check.
Rated major: it would touch a result — a value a result rests on, reported and recomputed p-values on opposite sides of the significance level, two passages that conflict with no sign which is right, or a cited work retracted before this paper was published.
In the paper
§ Image Encryption Algorithms: A Survey of Design and Evaluation Metrics > 3.2.2. Maximum Deviation
“D max = (0 + H × W) 2 + (254 × 0) = ( H × W 2 ), (12”
§ Image Encryption Algorithms: A Survey of Design and Evaluation Metrics > 3.2.2. Maximum Deviation
“D max = d 0 + d 255 2 + 254 ∑ i=1 d i d = histogram(|P -C|), (11”
Rated minor: it would not touch a result — a value no result rests on, a p-value that stays on the same side of the significance level, or a conflict that is clerical, resolved elsewhere in the paper, or outside its own findings.
In the paper
§ Image Encryption Algorithms: A Survey of Design and Evaluation Metrics > 3.3. Entropy Analysis
“Given that a pixel's maximum possible intensity value in an 8-bit representation is 256”
§ Image Encryption Algorithms: A Survey of Design and Evaluation Metrics > 3.5.3. Peak Signal-to-Noise Ratio
“MAX p is the maximum value that a pixel can have (which is typically 255 in 8-bit pixels).”
Rated minor: it would not touch a result — a value no result rests on, a p-value that stays on the same side of the significance level, or a conflict that is clerical, resolved elsewhere in the paper, or outside its own findings.
In the paper
§ Image Encryption Algorithms: A Survey of Design and Evaluation Metrics > 5. Conclusions
“We categorized image encryption algorithms into seven distinct classifications based on the techniques they employ, that is, chaotic systems, DNA encoding, neural networks, compressive sensing, frequency domain, and meaningful sensing.”
§ Image Encryption Algorithms: A Survey of Design and Evaluation Metrics > 1. Introduction
“These approaches are traditional ciphers, chaotic systems, DNA encoding, neural networks, compressive sensing, frequency domain, and meaningful sensing.”
Citations
Cites
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb01338.x · Cited by 88,486
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb00917.x · Cited by 48,949
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×
“To ensure a stronger level of security against brute force attacks, the key space of an image encryption algorithm should be larger than 2 100 [64].”
Background(2011) · Cited by 904
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×
“Local entropy is considered more accurate, consistent, and efficient than global Shannon entropy [53].”
BackgroundAn image encryption scheme based on chaotic tent map
Li, C., Luo, G., Qin, K., & Li, C. (2017) · Nonlinear Dynamics · doi:10.1007/s11071-016-3030-8 · Cited by 497 · cited 2×
“Chunhu et al. presented an algorithm in [15]; it utilizes a keystream generated by a tent map.”
MethodLi, Y., Wang, C., & Chen, H. (2017) · Optics and Lasers in Engineering · doi:10.1016/j.optlaseng.2016.10.020 · Cited by 420 · cited 2×
“In [18], Li et al. proposed a hyperchaos-based image encryption algorithm using pixel-level permutation, bit-level permutation, and diffusion.”
MethodTwofish : A 128-bit block cipher
Schneier, B. (1998) · Cited by 325
IFCIoT: Integrated Fog Cloud IoT: A novel architectural paradigm for the future Internet of Things
Munir, A., Kansakar, P., & Khan, S. U. (2017) · IEEE Consumer Electronics Magazine · doi:10.1109/mce.2017.2684981 · Cited by 252 · cited 2×
“Chaotic-based encryption algorithms are suitable for resource-constrained platforms, like the Internet of Things (IoT) and edge devices [62,67], due to their fast computational speed and minimal complexity.”
BackgroundSelf-citationDouble image encryption algorithm based on neural network and chaos
Man, Z., Li, J., Di, X., Sheng, Y., & Liu, Z. (2021) · Chaos, Solitons & Fractals · doi:10.1016/j.chaos.2021.111318 · Cited by 241 · cited 2×
“Man et al. [35] proposed a double image encryption algorithm based on the convolution neural network (CNN) and chaos.”
Method
Research works printed but not linked: 1
- Bernstein, D.J. (2008, January 13–14). ChaCha, a variant of Salsa20. Proceedings of the Workshop Record of SASC, Citeseer, Lausanne, Switzerland.
Cited by
Alexan, W., Shabasy, N. H. E., Ehab, N., & Maher, E. A. (2025) · Scientific Reports · doi:10.1038/s41598-025-15794-z · Cited by 89
Tiwari, A., Diwan, P., Diwan, T. D., Mahdal, M., & Samal, S. P. (2025) · Scientific Reports · doi:10.1038/s41598-025-95995-8 · Cited by 60
Image Encryption Using Chaotic Maps: Development, Application, and Analysis
Dinu, A., & Frunzete, M. C. (2025) · Mathematics · doi:10.3390/math13162588 · Cited by 52
Comprehensive Review and Analysis of Image Encryption Techniques
Mahalakshmi, K. B., & Nagarajan, S. (2025) · IEEE Access · doi:10.1109/access.2025.3578158 · Cited by 58
A new controllable multi-wing chaotic system: applications in high-security color image encryption
Ding, P., Geng, P., & Hu, W. (2024) · The Journal of Supercomputing · doi:10.1007/s11227-024-06635-3 · Cited by 28
Metadata
- Authors
- Alghamdi, Y., & Munir, A.
- Affiliations
- Kansas State University (US)
- Corresponding author
- Munir, Arslan
- Venue
- Journal of Cybersecurity and Privacy
- Publisher
- MDPI AG
- Published
- 2024-02-23
- Volume
- 4
- Issue
- 1
- Pages
- 126-152
- ISSN
- 2624-800X (ISSN-L)
- OpenAlex
- W4392100962
- Cited by
- 98
- References
- 64
- Citations by year
- 2026: 46 · 2025: 42 · 2024: 10
- FWCI
- 13.65
- Type
- journal article
- Language
- en
- Open access
- gold
- doi.org
- Licence
- Locations
- Journal of Cybersecurity and Privacy (publishedVersion, cc-by)
- DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion)
- 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 › Artificial Intelligence › Cryptographic Implementations and Security
- Keywords
- image encryption, evaluation metrics, security metrics, encryption efficiency, real-time image encryption, image confidentiality, image privacy
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.
The claim verdicts this report counts are experimental: their accuracy is not yet measured.
A language model drew the claims from the paper on 2026-10-11, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).
A second model labelled each claim on 2026-10-11 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).
Cited sources are checked with a language model’s help (gpt-6-sol).
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: Image Encryption Algorithms: A Survey of Design and Evaluation Metrics. https://app.cochat.ai/papers/10.3390/jcp4010007
- The paper
- Alghamdi, Y., & Munir, A. (2024). Image Encryption Algorithms: A Survey of Design and Evaluation Metrics. Journal of Cybersecurity and Privacy. https://doi.org/10.3390/jcp4010007
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.