Improving security of a chaotic encryption approach
The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
E. Alvarez et al. presented a new chaotic encryption approach recently. But soon G. Alvarez et al. broke it with four cryptanalytic methods and found some other weaknesses. In this Letter we point out why the original scheme is so vulnerable to the proposed four attacks. The chief reasons are two essential defects existing in the original scheme. Based on such a fact, we present an improved encryption scheme to obtain higher security. The cryptographic properties of the improved scheme are studied theoretically and experimentally in detail.
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
Applied cryptography: Protocols, algorithms, and source code in C
(1994) · Computer Law & Security Report · doi:10.1016/0267-3649(94)90017-5 · Cited by 3,411
Symmetric Ciphers Based on Two-Dimensional Chaotic Maps
Fridrich, J. (1998) · International Journal of Bifurcation and Chaos · doi:10.1142/s021812749800098x · Cited by 1,917 · cited 1×
“In the recent years, many researchers have found: when chaotic systems are discretely realized in finite precision, some serious problems will arise, such as short cycle length, non-ideal distribution and correlation functions [9–16].”
BackgroundLasota, A., & Mackey, M. C. (1994) · Applied Mathematical Sciences · doi:10.1007/978-1-4612-4286-4 · Cited by 1,353
Cited by
A new chaotic algorithm for image encryption
Gao, H., Zhang, Y., Liang, S., & Li, D. (2006) · Chaos, Solitons & Fractals · doi:10.1016/j.chaos.2005.08.110 · Cited by 512
ON THE DYNAMICAL DEGRADATION OF DIGITAL PIECEWISE LINEAR CHAOTIC MAPS
LI, S., CHEN, G., & MOU, X. (2005) · International Journal of Bifurcation and Chaos · doi:10.1142/s0218127405014052 · Cited by 433
Self-citationAn image encryption approach based on chaotic maps
Zhang, L., Liao, X., & Wang, X. (2005) · Chaos, Solitons & Fractals · doi:10.1016/j.chaos.2004.09.035 · Cited by 374
Image encryption using a new parametric switching chaotic system
Zhou, Y., Bao, L., & Chen, C. L. P. (2013) · Signal Processing · doi:10.1016/j.sigpro.2013.04.021 · Cited by 265
“…method to flat the image histogram because encrypted images with random-like histogram distribution are known to have excellent performance against statistics attacks [31 The 2D-PSCS transform as an image permutation process has the excellent property of breaking the correlation of image pixels.”
MethodOCML-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
“Conventional chaos-based cryptographic schemes, such as the well-known Baptista-type [2–9] and the Alvarez-type cryptosystems [10,11], have shown some inherent drawbacks [12–15].”
Method
Metadata
- Authors
- Li, S., Mou, X., & Cai, Y.
- Venue
- Physics Letters A
- Publisher
- Elsevier BV
- Published
- 2001-11
- Volume
- 290
- Issue
- 3-4
- Pages
- 127-133
- ISSN
- 0375-9601 (ISSN-L)
- OpenAlex
- W2165761297
- Cited by
- 136
- References
- 3
- FWCI
- 6.35
- Type
- journal article
- Language
- en
- Open access
- closed
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: Improving security of a chaotic encryption approach. https://app.cochat.ai/papers/10.1016/s0375-9601(01)00612-0
- The paper
- Li, S., Mou, X., & Cai, Y. (2001). Improving security of a chaotic encryption approach. Physics Letters A. https://doi.org/10.1016/s0375-9601(01)00612-0
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.