The DOI matches its Crossref record; 58 of the 60 references it cites were found in a registry or an index; none of the 3 sources its claims cite is checked for support yet.
A Bijective Image Encryption System Based on Hybrid Chaotic Map Diffusion and DNA Confusion
Open accessAbstract
Modern multimedia communications technology requirements have raised security standards, which allows for enormous development in security standards. This article presents an innovative symmetric cryptosystem that depends on the hybrid chaotic Lorenz diffusion stage and DNA confusion stage. It involves two identical encryption and decryption algorithms, which simplifies the implementation of transmitting and receiving schemes of images securely as a bijective system. Both schemes utilize two distinctive non-consecutive chaotic diffusion stages and one DNA scrambling stage in between. The generation of the coded secret bit stream employs a hybrid chaotic system, which is employed to encrypt or decrypt the transmitted image and is utilized in the diffusion process to dissipate the redundancy in the original transmitted image statistics. The transmitted image is divided into eight scrambled matrices according to the position of the pixel in every splitting matrix. Each binary matrix is converted using a different conversion rule in the Watson-Crick rules. The DNA confusion stage is applied to increase the complexity of the correlation between the transmitted image and the utilized key. These stages allow the proposed image encryption scheme to be more robust against chosen/known plaintext attacks, differential attacks, cipher image attacks, and information entropy. The system was revealed to be more sensitive against minimal change in the generated secret key. The analysis proves that the system has superior statistical properties, bulkier key space, better plain text sensitivity, and improved key sensitivity compared with former schemes.
Overview
CoChat Summary
## TL;DR
The paper proposes a bijective symmetric image encryption scheme that combines a 4D hyperchaotic Lorenz-based diffusion process with DNA-based confusion, using identical encryption and decryption structures. The authors report strong statistical properties, a large key space of \(1.6777 \times 10^{64}\), and near-theoretical sensitivity/attack-resistance metrics on 200 × 200 grayscale test images.
## Key findings
- The proposed key space is reported as \(1.6777 \times 10^{64}\), which the authors say is large enough to resist brute-force attacks; they estimate \(2.03451 \times 10^{21}\) days to crack it with 17 billion attempts per hour.
- For the Lena example, the information entropy is reported as 7.4430 for the plain image and 7.9882 for the cipher image, close to the 8-bit ideal.
- For cipher-image sensitivity, the paper reports average values of Diff3 = 99.6150 and Diff4 = 28.4170, described as near the hypothetical values.
- The paper reports NPCR and UACI values near their theoretical random-image values of 99.609% and 33.464%, and says the cipher histograms are nearly uniform with chi-square test p-values greater than 0.05 for Lena, Cameraman, and Circuit.
## Methods
- The design is a bijective symmetric image cryptosystem with two diffusion stages and one DNA confusion stage; encryption and decryption are identical in structure and use 180-degree matrix rotations between stages.
- The sample used in simulation consists of three 200 × 200 grayscale images: Lena, Cameraman, and Circuit, implemented in Mathematica 11.
- Main analysis includes histogram analysis, chi-square testing, correlation analysis, key space estimation, key sensitivity tests, NPCR/UACI differential tests, cipher-image sensitivity tests, and entropy/local entropy evaluation.
## Limitations
- The paper’s experiments are limited to three grayscale images of size 200 × 200, so broader evidence across image types, sizes, and color images is not stated in the paper.
- The text makes evident that the security evaluation is simulation-based and does not include implementation on real communication systems or hardware testing; this is evident from the described Mathematica experiments and reported metrics, not stated as a limitation.
- The paper does not state any formal cryptanalytic proof beyond the reported statistical and randomness tests, so claims about resistance are based on measured indicators rather than exhaustive security proofs; this is evident in the text.
Model-written summary. Check it against the paper before relying on it.
Integrity signals
Registry
Cites
Statistics
Figures






Verification
Claims the paper makes
0 Valid · 0 Not valid · 2 Not checked · 44 Own results and interpretations
A result the paper states — it cites no source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The correlation of plain images is high and close to 1.”
§ A Bijective Image Encryption System Based on Hybrid Chaotic Map Diffusion and DNA Confusion > 5. Performance and Security Analysis > 5.2. Statistical Attacks Analysis
plain- 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.
A result the paper states — it cites no source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“It would take 2.03451×1021 days to crack the systems if 17 billion attempts are tried hourly using a very high-performance machine.”
§ A Bijective Image Encryption System Based on Hybrid Chaotic Map Diffusion and DNA Confusion > 5. Performance and Security Analysis > 5.1. Key Space
hedgedstates a cause- 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.
A result the paper reports from its own data — 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 histograms of the original images of Lena, Cameraman, and Circuit shown in Figure 5a are non-uniform.”
§ A Bijective Image Encryption System Based on Hybrid Chaotic Map Diffusion and DNA Confusion > 5. Performance and Security Analysis > 5.2. Statistical Attacks Analysis
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.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“So, the presented cryptosystem attains high performance by getting NPCR values and UACI values near to their hypothetical values.”
§ A Bijective Image Encryption System Based on Hybrid Chaotic Map Diffusion and DNA Confusion > 5. Performance and Security Analysis > 5.4. Differential Attack
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.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Table 5 shows that the calculated results of Diff1, Diff2, Diff3, and Diff4 are nearly equal to their hypothetical values; these values indicators are designating that the presented scheme is very sensitive to minimal alteration in the generated secret key.”
§ A Bijective Image Encryption System Based on Hybrid Chaotic Map Diffusion and DNA Confusion > 5. Performance and Security Analysis > 5.3. Key Sensitivity Analysis
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.
27 more claims
Create a free account to see all 46 claims and every source verdict.
- It may state two separate claims as one. 13
- Probably not a substantial claim. 2
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 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
§ A Bijective Image Encryption System Based on Hybrid Chaotic Map Diffusion and DNA Confusion > 3. Proposed Image Cryptosystem
“the initial parameters of the 4D hyperchaotic system, whose value ranges are y0∈(− 40, 40), x0∈(− 40, 40), w0∈(− 250, 250), and z0∈(1, 81)”
§ A Bijective Image Encryption System Based on Hybrid Chaotic Map Diffusion and DNA Confusion > 5. Performance and Security Analysis > 5.1. Key Space
“The value ranges were x0∈(− 40,40), y0∈(−40,40), and z0∈(1,80) each with a step size of 10−13, while the value range of w0∈(−250,250) had a step size of 10−12.”
Citations
Cites
Deterministic Nonperiodic Flow
Lorenz, E. N. (1963) · Journal of the Atmospheric Sciences · doi:10.1175/1520-0469(1963)020<0130:dnf>2.0.co;2 · Cited by 19,398
Molecular Computation of Solutions to Combinatorial Problems
Adleman, L. M. (1994) · Science · doi:10.1126/science.7973651 · Cited by 4,474
A NEW CHAOTIC ATTRACTOR COINED
LÜ, J., & CHEN, G. (2002) · International Journal of Bifurcation and Chaos · doi:10.1142/s0218127402004620 · Cited by 1,862 · cited 1×
“Other chaotic systems introduced in succession include the Chen-Lu chaos system [31] and Liu chaos system [32].”
MethodSecure integration of IoT and Cloud Computing
Stergiou, C., Psannis, K. E., Kim, B.-G., & Gupta, B. (2018) · Future Generation Computer Systems · doi:10.1016/j.future.2016.11.031 · Cited by 1,094
ON THE DERIVATION OF A “CHAOTIC” ENCRYPTION ALGORITHM
Matthews, R. (1989) · Cryptologia · doi:10.1080/0161-118991863745 · Cited by 1,044
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×
“[50] have expressed a new entropy gauge to regulate the real randomness by picking the non‐overlapping blocks inside the encrypted image.”
BackgroundA chaos-based symmetric image encryption scheme using a bit-level permutation
Zhu, Z.-L., Zhang, W., Wong, K.-W., & Yu, H. (2011) · Information Sciences · doi:10.1016/j.ins.2010.11.009 · Cited by 662 · cited 1×
“Image Proposed System [51] [52] [53] [54] Lena 7.”
Image encryption using DNA complementary rule and chaotic maps
Liu, H., Wang, X., & kadir, A. (2012) · Applied Soft Computing · doi:10.1016/j.asoc.2012.01.016 · Cited by 626 · cited 1×
“[15] proposed an algorithm depending on a DNA rule merged with chaotic map.”
MethodLiu, C., Liu, T., Liu, L., & Liu, K. (2004) · Chaos, Solitons & Fractals · doi:10.1016/j.chaos.2004.02.060 · Cited by 602 · cited 1×
“Other chaotic systems introduced in succession include the Chen‐Lu chaos system [31] and Liu chaos system [32].”
BackgroundColor image encryption using spatial bit-level permutation and high-dimension chaotic system
Liu, H., & Wang, X. (2011) · Optics Communications · doi:10.1016/j.optcom.2011.04.001 · Cited by 591 · cited 1×
“A perfect cryptosystem must satisfy some performance analysis such as large key space, sensitivity to slight change in the secret key, and nearly no correlation between two consecutive adjacent pixels [21].”
Background
Cited by
Double 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
RGB Image Encryption through Cellular Automata, S-Box and the Lorenz System
Alexan, W., ElBeltagy, M., & Aboshousha, A. (2022) · Symmetry · doi:10.3390/sym14030443 · Cited by 187
A Hybrid Domain Image Encryption Algorithm Based on Improved Henon Map
Chen, Y., Xie, S.-C., & Zhang, J. (2022) · Entropy · doi:10.3390/e24020287 · Cited by 81
On the Image Encryption Algorithm Based on the Chaotic System, DNA Encoding, and Castle
Iqbal, N., Naqvi, R. A., Atif, M., Khan, M. A., Hanif, M., Abbas, S., & Hussain, D. (2021) · IEEE Access · doi:10.1109/access.2021.3106028 · Cited by 74
“According to the set of recommendations given [53], the parameters ( k , T B ) are set as (30, 1936).”
BackgroundIqbal, N., Hanif, M., Abbas, S., Khan, M. A., & Rehman, Z. U. (2021) · Journal of Information Security and Applications · doi:10.1016/j.jisa.2021.102809 · Cited by 73
Metadata
- Authors
- ElKamchouchi, D. H., Mohamed, H. G., & Moussa, K. H.
- Affiliations
- Princess Nourah bint Abdulrahman University (SA)
- Horus University – Egypt (EG)
- Corresponding author
- Mohamed, Heba G.
- Venue
- Entropy
- Publisher
- MDPI AG
- Published
- 2020-02-05
- Volume
- 22
- Issue
- 2
- Pages
- 180
- ISSN
- 1099-4300 (ISSN-L)
- PMC
- PMC7516607
- OpenAlex
- W3005148514
- Cited by
- 63
- References
- 60
- Citations by year
- 2026: 1 · 2025: 9 · 2024: 6 · 2023: 13 · 2022: 15 · 2021: 14 · 2020: 5
- FWCI
- 4.57
- Type
- journal article
- Language
- en
- Open access
- gold
- dx.doi.org
- Licence
- Locations
- Entropy (publishedVersion, cc-by)
- PubMed Central (publishedVersion, cc-by)
- PubMed (publishedVersion)
- DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
- Funders
- Princess Nourah Bint Abdulrahman University (100)
- 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, Lorenz map, symmetric ciphers, key sensitivity, key space, differential attack resistance, Shannon entropy, image steganography
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.
A language model drew the claims from the paper on 2026-10-10, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).
A second model labelled each claim on 2026-10-10 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).
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: A Bijective Image Encryption System Based on Hybrid Chaotic Map Diffusion and DNA Confusion. https://app.cochat.ai/papers/10.3390/e22020180
- The paper
- ElKamchouchi, D. H., Mohamed, H. G., & Moussa, K. H. (2020). A Bijective Image Encryption System Based on Hybrid Chaotic Map Diffusion and DNA Confusion. Entropy. https://doi.org/10.3390/e22020180
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.