Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat

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 access

Abstract

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

Crossref · 10.3390/e22020180

Cites

58 of 58 references verified0 citation errors · 0 not checkable

Statistics

Nothing to recompute.

Figures

Figure 1 An example of image securing scheme that depends on a chaotic map: (a) traditional encryption, (b) traditional decryption.
Figure 1 An example of image securing scheme that depends on a chaotic map: (a) traditional encryption, (b) traditional decryption.CC BY · PubMed Central
Figure 2 The proposed securing system for images: (a) encryption process, (b) decryption process.
Figure 2 The proposed securing system for images: (a) encryption process, (b) decryption process.CC BY · PubMed Central
Figure 3 The effect of applying the first three steps of the DNA mutation scrambling stage on a 10 × 10 matrix.
Figure 3 The effect of applying the first three steps of the DNA mutation scrambling stage on a 10 × 10 matrix.CC BY · PubMed Central
Figure 4 Simulation results. (a) plain images, (b) Generated cipher images of (a), (c) Recovered image from (b).
Figure 4 Simulation results. (a) plain images, (b) Generated cipher images of (a), (c) Recovered image from (b).CC BY · PubMed Central
Figure 5 Histograms analysis. (a) Histograms of plain images, (b) Histograms of cipher images.
Figure 5 Histograms analysis. (a) Histograms of plain images, (b) Histograms of cipher images.CC BY · PubMed Central
Figure 6 Correlation analysis plot. (a) Horizontal direction correlation for plain images Lena, Cameraman, and Circuit, (b) Horizontal correlation for their cipher images respectively.
Figure 6 Correlation analysis plot. (a) Horizontal direction correlation for plain images Lena, Cameraman, and Circuit, (b) Horizontal correlation for their cipher images respectively.CC BY · PubMed Central

Verification

Claims the paper makes

0 Valid · 0 Not valid · 2 Not checked · 44 Own results and interpretations

27 more claims

Create a free account to see all 46 claims and every source verdict.

See all claims — free account
  • It may state two separate claims as one. 13
  • Probably not a substantial claim. 2

Create a free account to see these claims.

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.

1 of 1

Citations

Cites

Cited by

See all 63

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)
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
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

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.