Cryptanalysis of an Image Encryption Algorithm Using DNA Coding and Chaos
Open accessAbstract
In recent years, many chaotic image encryption algorithms have been cracked by chosen plaintext attack. Therefore, the method of associating the key with the plaintext to resist the cryptanalysis has received extensive attention from designers. This paper proposes a new method of cryptanalysis for image encryption algorithms with a key associated with plaintext. We broke an image encryption scheme using chaos and DNA encoding. Through our comprehensive security analysis, we found a security vulnerability in the mechanism of the association between the key and plaintext and proposed a breaking scheme. The experimental results show that the chosen plaintext attack can recover the cipher image to the plain image. The cryptanalysis scheme proposed in this paper can provide new ideas for subsequent cryptanalysis work and also provide some meaningful references for designers to improve the security of encryption algorithms when designing them. In addition, we also propose an improved logistic chaotic map with random bit-position scrambling. The improved chaotic map has a wider parameter range and a larger Lyapunov exponent. In the end, some suggestions are given to improve the original algorithm to resist such attacks.
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Cites
Depreciating motivation and empirical security analysis of chaos-based image and video encryption
Preishuber, M., Hutter, T., Katzenbeisser, S., & Uhl, A. (2018) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2018.2812080 · Cited by 256 · see citing works
A novel plaintext-related image encryption scheme using hyper-chaotic system
Li, Z., Peng, C., Li, L., & Zhu, X. (2018) · Nonlinear Dynamics · doi:10.1007/s11071-018-4426-4 · Cited by 142 · see citing works
Flagged first, then by citations
- Authors
- Zhao, Y., Shi, Q., & Ding, Q.
- Affiliations
- Heilongjiang University (CN)
- Corresponding author
- Ding, Qun
- Venue
- Entropy
- Publisher
- MDPI AG
- Published
- 2025-01-07
- Volume
- 27
- Issue
- 1
- Pages
- 40
- ISSN
- 1099-4300 (ISSN-L)
- PMC
- PMC11764916
- OpenAlex
- W4406126273
- Cited by
- 33
- References
- 2
- Citations by year
- 2026: 20 · 2025: 13
- FWCI
- 11.59
- Type
- journal article
- Language
- en
- Open access
- gold
- 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
- National Natural Science Foundation of China (61471158)
- 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, cryptanalysis, DNA coding, chaos, chosen-plaintext attack, logistic map, Lyapunov exponents
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