Application of DNA Coding, the Lorenz Differential Equations and a Variation of the Logistic Map in a Multi-Stage Cryptosystem
Open accessThe DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Abstract
The need for information security has become urgent due to the constantly changing nature of the Internet and wireless communications, as well as the daily generation of enormous volumes of multimedia. In this paper, a 3-stage image cryptosystem is developed and proposed. A tan variation of the logistic map is utilized to carry out deoxyribonucleic acid (DNA) encoding in the first stage. For the second encryption stage, the numerical solution of the Lorenz differential equations and a linear descent algorithm are jointly employed to build a robust S-box. The logistic map in its original form is utilized in the third stage. Diffusion is guaranteed through the first and third encryption stages, while confusion is guaranteed through the application of the S-box in the second encryption stage. Carrying out both confusion- and diffusion-inducing stages results in encrypted images that are completely asymmetric to their original (plain) counterparts. An extensive numerical analysis is carried out and discussed, showcasing the robustness and efficacy of the proposed algorithm in terms of resistance to visual, statistical, entropy, differential, known plaint text and brute-force attacks. Average values for the computed metrics are: Information entropy of 7.99, MSE of 9704, PSNR of 8.3 dB, MAE of 80.8, NPCR of 99.6 and UACI of 33. The proposed algorithm is shown to exhibit low computational complexity, encrypting images at an average rate of 1.015 Mbps. Moreover, it possesses a large key space of 2372, and is demonstratd to successfully pass all the tests of the NIST SP 800 suite. In order to demonstrate the superior performance of the proposed algorithm, a comparison with competing image encryption schemes from the literature is also provided.
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
Simple mathematical models with very complicated dynamics
May, R. M. (1976) · Nature · doi:10.1038/261459a0 · Cited by 7,001
Differential cryptanalysis of DES-like cryptosystems
Biham, E., & Shamir, A. (1991) · Journal of Cryptology · doi:10.1007/bf00630563 · Cited by 2,914
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
Color image encryption based on hybrid hyper-chaotic system and cellular automata
Yaghouti Niyat, A., Moattar, M. H., & Niazi Torshiz, M. (2017) · Optics and Lasers in Engineering · doi:10.1016/j.optlaseng.2016.10.019 · Cited by 383
Multi chaotic systems based pixel shuffle for image encryption
Huang, C. K., & Nien, H. H. (2009) · Optics Communications · doi:10.1016/j.optcom.2009.02.044 · Cited by 325
Color image DNA encryption using NCA map-based CML and one-time keys
Wu, X., Wang, K., Wang, X., Kan, H., & Kurths, J. (2018) · Signal Processing · doi:10.1016/j.sigpro.2018.02.028 · Cited by 321
OCML-based colour image encryption
Rhouma, R., Meherzi, S., & Belghith, S. (2009) · Chaos, Solitons & Fractals · doi:10.1016/j.chaos.2007.07.083 · Cited by 195
Image 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
Self-citationAsymmetric color image encryption scheme using 2D discrete-time map
Liu, H., & Kadir, A. (2015) · Signal Processing · doi:10.1016/j.sigpro.2015.01.016 · Cited by 170
A Novel Construction of Efficient Substitution-Boxes Using Cubic Fractional Transformation
Zahid, A. H., Arshad, M. J., & Ahmad, M. (2019) · Entropy · doi:10.3390/e21030245 · Cited by 122
Cited by
Alexan, W., Alexan, N., & Gabr, M. (2023) · Fractal and Fractional · doi:10.3390/fractalfract7040287 · Cited by 144
Self-citationGabr, M., Korayem, Y., Chen, Y.-L., Yee, P. L., Ku, C. S., & Alexan, W. (2023) · IEEE Access · doi:10.1109/access.2023.3326848 · Cited by 79
Self-citationA new fast multiple color image encryption algorithm
Alexan, W., Hosny, K., & Gabr, M. (2025) · Cluster Computing · doi:10.1007/s10586-024-04919-0 · Cited by 79
“The literature presents many different chaotic and hyperchaotic functions that have been used in image encryption, including the Logistic map [29], He´non map [47], Lorenz system [29, 48], Langton’s Ant [22], and Chua circuit [49], among others.”
Self-citationFibonacci Q-Matrix, Hyperchaos, and Galois Field (2⁸) for Augmented Medical Image Encryption
El-Damak, D., Alexan, W., Mamdouh, E., El-Aasser, M., Fathy, A., & Gabr, M. (2024) · IEEE Access · doi:10.1109/access.2024.3433499 · Cited by 75
Self-citationImage Encryption via Base-n PRNGs and Parallel Base-n S-Boxes
Gabr, M., Elias, R., Hosny, K. M., Papakostas, G. A., & Alexan, W. (2023) · IEEE Access · doi:10.1109/access.2023.3301460 · Cited by 72
Self-citation
Metadata
- Authors
- Gabr, M., Younis, H., Ibrahim, M., Alajmy, S., Khalid, I., Azab, E., Elias, R., & Alexan, W.
- Venue
- Symmetry
- Publisher
- MDPI AG
- Published
- 2022-12-04
- Volume
- 14
- Issue
- 12
- Pages
- 2559
- ISSN
- 2073-8994 (ISSN-L)
- OpenAlex
- W4311521422
- Cited by
- 75
- References
- 11
- FWCI
- 4.86
- 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: Application of DNA Coding, the Lorenz Differential Equations and a Variation of the Logistic Map in a Multi-Stage Cryptosystem. https://app.cochat.ai/papers/10.3390/sym14122559
- The paper
- Gabr, M., Younis, H., Ibrahim, M., Alajmy, S., Khalid, I., Azab, E., Elias, R., & Alexan, W. (2022). Application of DNA Coding, the Lorenz Differential Equations and a Variation of the Logistic Map in a Multi-Stage Cryptosystem. Symmetry. https://doi.org/10.3390/sym14122559
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.