Cryptanalysis of S-box-only chaotic image ciphers against chosen plaintext attack
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?
A CPA for S-Box-only chaotic image encryption has computational complexity O(128L), where L is the total number of pixels in the image.
“A CPA for S-Box-only chaotic image encryption was proposed by Yushu Zhang and Di Xiao [179], who pointed out that the computational complexity is only O (128L).”
From Chaos-Based Image Encryption: Review, Application, and Challenges (2023) · cites this paper as [179]
Cites
Communication Theory of Secrecy Systems
Shannon, C. E. (1949) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1949.tb00928.x · Cited by 9,440 · cited 1× · see citing works
“These schemes have an interesting structure of confusion– diffusion [10], which is directly related to the concept of substitution–permutation (S–”
Background
Flagged first, then by citations
Cited by
Sorted by citations
A symmetric image encryption algorithm based on mixed linear–nonlinear coupled map lattice
Zhang, Y.-Q., & Wang, X.-Y. (2014) · Information Sciences · doi:10.1016/j.ins.2014.02.156 · Cited by 566 · see citing works
Self-citationChaos-Based Image Encryption: Review, Application, and Challenges
Zhang, B., & Liu, L. (2023) · Mathematics · doi:10.3390/math11112585 · Cited by 328 · see citing works
“A CPA for S-Box-only chaotic image encryption was proposed by Yushu Zhang and Di Xiao [179], who pointed out that the computational complexity is only O (128L).”
MethodAn 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 · see citing works
An efficient self-adaptive model for chaotic image encryption algorithm
Huang, X., & Ye, G. (2014) · Communications in Nonlinear Science and Numerical Simulation · doi:10.1016/j.cnsns.2014.04.012 · Cited by 72 · see citing works
- Authors
- Zhang, Y., & Xiao, D.
- Affiliations
- Chongqing University (CN)
- Corresponding author
- Xiao, Di
- ORCID
- Venue
- Nonlinear Dynamics
- Published
- 2013-01-24
- Volume
- 72
- Issue
- 4
- Pages
- 751-756
- ISSN
- 0924-090X (ISSN-L)
- 1573-269X
- OpenAlex
- W1968294195
- Cited by
- 81
- References
- 1
- Citations by year
- 2025: 2 · 2024: 5 · 2023: 5 · 2022: 2 · 2021: 3 · 2020: 10 · 2019: 4 · 2018: 10 · 2017: 10 · 2016: 7 · 2015: 5 · 2014: 12 · 2013: 6
- FWCI
- 11.25
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- www.springer.com/tdm (tdm)
- Locations
- Nonlinear Dynamics (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Chaos-based Image/Signal Encryption
- Physical Sciences › Computer Science › Artificial Intelligence › Cryptographic Implementations and Security
- Physical Sciences › Computer Science › Artificial Intelligence › Computer Science and Engineering
- Keywords
- cryptanalysis, chosen-plaintext attack, substitution cipher, attack complexity, image encryption
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
