BREAKING A CHAOTIC CRYPTOGRAPHIC SCHEME BASED ON COMPOSITION MAPS
Open accessThe DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Abstract
Recently a chaotic cryptographic scheme based on composition maps was proposed. This paper studies the security of the scheme and reports the following problems: (1) the scheme can be broken by a differential attack with 6 + ⌈ log L(MN)⌉ chosen plaintexts, where MN is the size of the plaintext and L is the number of different elements in plaintext; (2)the two composition maps both do not work as a secure and efficient source of random numbers; (3)the scheme is not sensitive to the changes of the plaintext.
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
Bassham, L. E., Rukhin, A. L., Soto, J., Nechvatal, J. R., Smid, M. E., Barker, E. B., Leigh, S. D., Levenson, M., Vangel, M., Banks, D. L., et al. (2010) · NIST Special Publication 800-22 Revision 1a · doi:10.6028/nist.sp.800-22r1a · Cited by 3,617 · cited 1×
“To further test the randomness of the sequences generated by the two equations, we adopted the test suite proposed in [23].”
MethodSOME BASIC CRYPTOGRAPHIC REQUIREMENTS FOR CHAOS-BASED CRYPTOSYSTEMS
ALVAREZ, G., & LI, S. (2006) · International Journal of Bifurcation and Chaos · doi:10.1142/s0218127406015970 · Cited by 2,119 · cited 2×
“As for how to evaluate the security of a chaotic cryptographic scheme, please refer to [18].”
BackgroundSymmetric Ciphers Based on Two-Dimensional Chaotic Maps
Fridrich, J. (1998) · International Journal of Bifurcation and Chaos · doi:10.1142/s021812749800098x · Cited by 1,917
Rukhin, A., Sota, J., Nechvatal, J., Smid, M., Barker, E., Leigh, S., Levenson, M., Vangel, M., Banks, D., Heckert, A., et al. (2000) · doi:10.6028/nist.sp.800-22 · Cited by 1,867
Image encryption using chaotic logistic map
Pareek, N. K., Patidar, V., & Sud, K. K. (2006) · Image and Vision Computing · doi:10.1016/j.imavis.2006.02.021 · Cited by 1,261
Li, S., Li, C., Chen, G., Bourbakis, N. G., & Lo, K.-T. (2008) · Signal Processing: Image Communication · doi:10.1016/j.image.2008.01.003 · Cited by 339 · cited 1×
“As shown in [22], any permutation-only cryptographic scheme can be broken with only O (log L ( MN )) known/chosen plain-texts, where L is the number of different element in plain-text. broken with the six chosen plain-images of fixed values, 9, 127, 1, 52, 33 and 65, as shown in Fig.”
MethodSelf-citationSecurity analysis of a chaos-based image encryption algorithm
Lian, S., Sun, J., & Wang, Z. (2005) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/j.physa.2005.01.001 · Cited by 193
Fast encryption of image data using chaotic Kolmogorov flows
Scharinger, J. (1998) · Journal of Electronic Imaging · doi:10.1117/1.482647 · Cited by 186
Cited by
Image encryption using 2D Logistic-adjusted-Sine map
Hua, Z., & Zhou, Y. (2016) · Information Sciences · doi:10.1016/j.ins.2016.01.017 · Cited by 736
A novel chaos-based image encryption using DNA sequence operation and Secure Hash Algorithm SHA-2
Guesmi, R., Farah, M. A. B., Kachouri, A., & Samet, M. (2016) · Nonlinear Dynamics · doi:10.1007/s11071-015-2392-7 · Cited by 363
A novel image encryption algorithm based on a 3D chaotic map
Kanso, A., & Ghebleh, M. (2012) · Communications in Nonlinear Science and Numerical Simulation · doi:10.1016/j.cnsns.2011.11.030 · Cited by 267
Design of image cipher using life-like cellular automata and chaotic map
Ping, P., Wu, J., Mao, Y., Xu, F., & Fan, J. (2018) · Signal Processing · doi:10.1016/j.sigpro.2018.04.018 · Cited by 71
A Novel Design of Cryptographic SP-Network Based on Gold Sequences and Chaotic Logistic Tent System
Khan, M. F., Ahmed, A., Saleem, K., & Shah, T. (2019) · IEEE Access · doi:10.1109/access.2019.2925081 · Cited by 27
Metadata
- Authors
- LI, C., ARROYO, D., & LO, K.-T.
- Venue
- International Journal of Bifurcation and Chaos
- Publisher
- World Scientific Pub Co Pte Lt
- Published
- 2010-08
- Volume
- 20
- Issue
- 08
- Pages
- 2561-2568
- ISSN
- 0218-1274 (ISSN-L)
- 1793-6551
- OpenAlex
- W1985339448
- Cited by
- 46
- References
- 8
- FWCI
- 2.58
- Type
- journal article
- Language
- en
- Open access
- green
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: BREAKING A CHAOTIC CRYPTOGRAPHIC SCHEME BASED ON COMPOSITION MAPS. https://app.cochat.ai/papers/10.1142/s0218127410027192
- The paper
- LI, C., ARROYO, D., & LO, K.-T. (2010). BREAKING A CHAOTIC CRYPTOGRAPHIC SCHEME BASED ON COMPOSITION MAPS. International Journal of Bifurcation and Chaos. https://doi.org/10.1142/s0218127410027192
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.