DNA and Plaintext Dependent Chaotic Visual Selective Image Encryption
Open accessThe DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Abstract
Visual selective image encryption can both improve the efficiency of the image encryption algorithm and reduce the frequency and severity of attacks against data. In this article, a new form of encryption is proposed based on keys derived from Deoxyribonucleic Acid (DNA) and plaintext image. The proposed scheme results in chaotic visual selective encryption of image data. In order to make and ensure that this new scheme is robust and secure against various kinds of attacks, the initial conditions of the chaotic maps utilized are generated from a random DNA sequence as well as plaintext image via an SHA-512 hash function. To increase the key space, three different single dimension chaotic maps are used. In the proposed scheme, these maps introduce diffusion in a plain image by selecting a block that have greater correlation and then it is bitwise XORed with the random matrix. The other two chaotic maps break the correlation among adjacent pixels via confusion (row and column shuffling). Once the ciphertext image has been divided into the respective units of Most Significant Bits (MSBs) and Least Significant Bit (LSBs), the host image is passed through lifting wavelet transformation, which replaces the low-frequency blocks of the host image (i.e., HL and HH) with the aforementioned MSBs and LSBs of ciphertext. This produces a final visual selective encrypted image and all security measures proves the robustness of the proposed scheme.
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
Prediction and Entropy of Printed English
Shannon, C. E. (1951) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1951.tb01366.x · Cited by 2,686
ON THE DERIVATION OF A “CHAOTIC” ENCRYPTION ALGORITHM
Matthews, R. (1989) · Cryptologia · doi:10.1080/0161-118991863745 · Cited by 1,044
Chen, J., Zhu, Z.-L., Zhang, L.-B., Zhang, Y., & Yang, B.-Q. (2018) · Signal Processing · doi:10.1016/j.sigpro.2017.07.034 · Cited by 320 · cited 1×
“This scheme was found significantly more efficient due to its promotion of re-usable random variables [31].”
BackgroundAn Efficient Image Encryption Scheme Based on the LSS Chaotic Map and Single S-Box
Lu, Q., Zhu, C., & Deng, X. (2020) · IEEE Access · doi:10.1109/access.2020.2970806 · Cited by 281
Brief review on application of nonlinear dynamics in image encryption
Özkaynak, F. (2018) · Nonlinear Dynamics · doi:10.1007/s11071-018-4056-x · Cited by 262 · cited 1×
“The checklist provided in [37] has been kept in mind while analysing the security of the proposed scheme.”
A Secure and Fast Image Encryption Scheme Based on Double Chaotic S-Boxes
Zhu, S., Wang, G., & Zhu, C. (2019) · Entropy · doi:10.3390/e21080790 · Cited by 131 · cited 2×
“The scheme in [6] takes 0.4640 seconds and the scheme in [7] takes 0.093 seconds as per their defined specification of the systems, respectively.”
BackgroundInfluentialChaos-Based Confusion and Diffusion of Image Pixels Using Dynamic Substitution
Qayyum, A., Ahmad, J., Boulila, W., Rubaiee, S., Arshad, Masood, F., Khan, F., & Buchanan, W. J. (2020) · IEEE Access · doi:10.1109/access.2020.3012912 · Cited by 111 · cited 1×
“The authors in [11], used Ikeda chaotic map, Henon map an S-box to designed dynamic S-box based image encryption scheme.”
MethodSelf-citationA Secure and Robust Image Hashing Scheme Using Gaussian Pyramids
Bashir, I., Ahmed, F., Ahmad, J., Boulila, W., & Alharbi, N. (2019) · Entropy · doi:10.3390/e21111132 · Cited by 20 · cited 1×
“Mathematically, a Gaussian map can be computed as follows [33]–[35]: here a and b denote different control parameters.”
BackgroundSelf-citation
Cited by
Chaos and compressive sensing based novel image encryption scheme
Khan, J. S., & Kayhan, S. K. (2021) · Journal of Information Security and Applications · doi:10.1016/j.jisa.2020.102711 · Cited by 65
Self-citationAn image encryption scheme based on IAVL permutation scheme and DNA operations
Sha, Y., Cao, Y., Yan, H., Gao, X., & Mou, J. (2021) · IEEE Access · doi:10.1109/access.2021.3094563 · Cited by 31
Ogras, H. (2021) · Cogent Engineering · doi:10.1080/23311916.2021.1940638 · Cited by 13
Metadata
- Authors
- Khan, J. S., Boulila, W., Ahmad, J., Rubaiee, S., Rehman, A. U., Alroobaea, R., & Buchanan, W. J.
- Venue
- IEEE Access
- Published
- 2020
- Volume
- 8
- Pages
- 159732-159744
- ISSN
- 2169-3536 (ISSN-L)
- OpenAlex
- W3081655872
- Cited by
- 94
- References
- 8
- FWCI
- 6.91
- 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: DNA and Plaintext Dependent Chaotic Visual Selective Image Encryption. https://app.cochat.ai/papers/10.1109/access.2020.3020917
- The paper
- Khan, J. S., Boulila, W., Ahmad, J., Rubaiee, S., Rehman, A. U., Alroobaea, R., & Buchanan, W. J. (2020). DNA and Plaintext Dependent Chaotic Visual Selective Image Encryption. IEEE Access. https://doi.org/10.1109/access.2020.3020917
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.