Cryptanalysis of a chaotic image encryption method
Abstract
The security of digital images attracts much attention recently, and many image encryption methods have been proposed. In IS-CAS2000, a new chaotic key-based algorithm (CKBA) for image encryption was proposed. This paper points out CKBA is very weak to the chosen/known-plaintext attack with only one plain-image, and its security to brute-force ciphertext-only attack is overestimated by the authors. That is to say, CKBA is not secure at all from cryptographic viewpoint. Some experiments are made to show the feasibility of the chosen/known-plaintext attack. We also discuss some remedies to the original scheme and their performance, and we find none of them can essentially improve the security of CKBA.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The security of the Chaotic Key-Based Algorithm (CKBA) needs to be improved.
“However, Shujun Li and Xuan Zheng [83] estimated its security and pointed out that this algorithm is weak for the known-plaintext attack, which implies that the security of the algorithm needs to be improved.”
From Chaos-Based Image Encryption: Review, Application, and Challenges (2023) · cites this paper as [83]
The Chaotic Key-Based Algorithm (CKBA) is weak against the known-plaintext attack.
“However, Shujun Li and Xuan Zheng [83] estimated its security and pointed out that this algorithm is weak for the known-plaintext attack, which implies that the security of the algorithm needs to be improved.”
From Chaos-Based Image Encryption: Review, Application, and Challenges (2023) · cites this paper as [83]
The citation lists haven’t been fetched yet
References 15 · Cited by 262
- Authors
- Li, S., & Zheng, X.
- Affiliations
- Xi'an Jiaotong University (CN)
- ORCID
- Venue
- 2002 IEEE International Symposium on Circuits and Systems. Proceedings (Cat. No.02CH37353)
- Publisher
- IEEE
- Published
- 2003-06-25
- Pages
- II-708-II-711
- ISSN
- 0271-4302 (ISSN-L)
- OpenAlex
- W2170926081
- Cited by
- 262
- References
- 15
- Citations by year
- 2026: 1 · 2024: 4 · 2023: 4 · 2022: 8 · 2021: 11 · 2020: 15 · 2019: 7 · 2018: 21 · 2017: 12 · 2016: 3 · 2015: 17 · 2014: 11 · 2013: 19 · 2012: 18
- FWCI
- 7.39
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- IEEE International Symposium on Circuits and Systems proceedings (publishedVersion)
- Surrey Research Insight Open Access (The University of Surrey) (submittedVersion)
- 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
- chaotic image encryption, cryptanalysis, chosen-plaintext attack, known-plaintext attack, image security
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
