The DOI matches its Crossref record; 137 of the 137 references it cites were found in a registry or an index.
SOME BASIC CRYPTOGRAPHIC REQUIREMENTS FOR CHAOS-BASED CRYPTOSYSTEMS
Open accessAbstract
In recent years, a large amount of work on chaos-based cryptosystems have been published. However, many of the proposed schemes fail to explain or do not possess a number of features that are fundamentally important to all kind of cryptosystems. As a result, many proposed systems are difficult to implement in practice with a reasonable degree of security. Likewise, they are seldom accompanied by a thorough security analysis. Consequently, it is difficult for other researchers and end users to evaluate their security and performance. This work is intended to provide a common framework of basic guidelines that, if followed, could benefit every new cryptosystem. The suggested guidelines address three main issues: implementation, key management and security analysis, aiming at assisting designers of new cryptosystems to present their work in a more systematic and rigorous way to fulfill some basic cryptographic requirements. Meanwhile, several recommendations are made regarding some practical aspects of analog chaos-based secure communications, such as channel noise, limited bandwith and attenuation.
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.
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 source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“According to the discussions in [1] , the key space of a chaos-based cryptosystem must reach the size of 2 100 to resist various attacks.”
From Cosine-transform-based chaotic system for image encryption (2019) · cites this paper as [1]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“The key space of the LSC-IES is 2 256 , which satisfies the key size requirements and exhibits high performance in resisting various security attacks [1] .”
From Cosine-transform-based chaotic system for image encryption (2019) · cites this paper as [1]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Chaotic mathematical models have properties such as strong reactions to changes in initial conditions, randomlike behavior and ergodicity which are also desired for cryptography [5,7].”
From A novel single kernel parallel image encryption scheme based on a chaotic map (2024) · cites this paper as [5]
Experimental — accuracy not yet measuredThe cited source says what the claim attributes to it.
In the citing paper
“Otherwise, incorrect secret keys with slight differences may also correctly decrypt the information of the original image, which may make the actual key space smaller than the theoretical one [1] .”
From Cosine-transform-based chaotic system for image encryption (2019) · cites this paper as [1]
The cited source says what the claim attributes to it.
In the citing paper
“Thus, the algorithm's designer should make this attack computationally unfeasible, having a large enough key space such that it would take decades to test all possible keys, and this desired key space is of at least 2 100 [5].”
From A novel single kernel parallel image encryption scheme based on a chaotic map (2024) · cites this paper as [5]
3 more claims about this paper
Create a free account to see every claim other papers make about this one.
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
The Art of Computer Programming
Knuth, D. E. (1968) · Cited by 16,337
Synchronization in chaotic systems
Pecora, L. M., & Carroll, T. L. (1990) · Physical Review Letters · doi:10.1103/physrevlett.64.821 · Cited by 10,625
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
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
Synchronization: A Universal Concept in Nonlinear Sciences
Pikovsky, A., Rosenblum, M., & Kurths, J. (2001) · Cambridge University Press eBooks · doi:10.1017/cbo9780511755743 · Cited by 4,652
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
The synchronization of chaotic systems
Boccaletti, S., Kurths, J., Osipov, G., Valladares, D. L., & Zhou, C. S. (2002) · Physics Reports · doi:10.1016/s0370-1573(02)00137-0 · Cited by 2,764
Linear Cryptanalysis Method for DES Cipher
Matsui, M. (1994) · Lecture Notes in Computer Science · doi:10.1007/3-540-48285-7_33 · Cited by 2,748 · cited 3×
“Linear cryptanalysis was first introduced by Matsui [1994].”
BackgroundMethodCryptography: Theory and Practice
Stinson, D. R. (1995) · Cited by 2,743
An Introduction to Chaotic Dynamical Systems
Devaney, R. L., & Eckmann, J.-P. (1987) · Physics Today · doi:10.1063/1.2820117 · Cited by 2,344
Research works printed but not linked: 8
- Hu G., IEEE Trans. Circuits Syst.-I, 50, 275
- Lee P.-H., Chinese J. Phys., 41, 559
- Li S., J. Electron. Inform. Technol., 25, 473
- Li S., Int. J. Bifurcation and Chaos, 11, 3063
- Matthews R. A. J., Cryptologia, 29
- Uís J., Chaos, 8, 819
- Yang T., Int. J. Comp. Cogn., 2, 81
- Zhou H., Int. J. Bifurcation and Chaos, 7, 205
Cited by
Cosine-transform-based chaotic system for image encryption
Hua, Z., Zhou, Y., & Huang, H. (2019) · Information Sciences · doi:10.1016/j.ins.2018.12.048 · Cited by 776
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
“To resist the brute-force attack, key space of a chaos-based encryption scheme should be larger than 2100 [1].”
BackgroundA chaos-based symmetric image encryption scheme using a bit-level permutation
Zhu, Z.-L., Zhang, W., Wong, K.-W., & Yu, H. (2011) · Information Sciences · doi:10.1016/j.ins.2010.11.009 · Cited by 662
“a[6][6] a[6][7] a[6][8] a[5][1] a[5][2]”
BackgroundInfluentialImage encryption using DNA complementary rule and chaotic maps
Liu, H., Wang, X., & kadir, A. (2012) · Applied Soft Computing · doi:10.1016/j.asoc.2012.01.016 · Cited by 626
2D Logistic-Sine-coupling map for image encryption
Hua, Z., Jin, F., Xu, B., & Huang, H. (2018) · Signal Processing · doi:10.1016/j.sigpro.2018.03.010 · Cited by 595
“According to the discussion in [46] , the key length of a chaos-based encryption algorithm should be larger than 100 bits to resist brute-force attack.”
Background
Metadata
- Authors
- ALVAREZ, G., & LI, S.
- Affiliations
- Instituto de Física Aplicada, Consejo Superior de Investigaciones Científicas, Serrano 144, 28006 Madrid, Spain
- Hong Kong Polytechnic University (HK)
- ORCID
- LI, SHUJUN
- Venue
- International Journal of Bifurcation and Chaos
- Publisher
- World Scientific Pub Co Pte Ltd
- Published
- 2006-08
- Volume
- 16
- Issue
- 08
- Pages
- 2129-2151
- ISSN
- 0218-1274 (ISSN-L)
- 1793-6551
- OpenAlex
- W2105145864
- Cited by
- 2,119
- References
- 137
- Citations by year
- 2026: 137 · 2025: 158 · 2024: 175 · 2023: 183 · 2022: 213 · 2021: 164 · 2020: 155 · 2019: 140 · 2018: 116 · 2017: 88 · 2016: 78 · 2015: 82 · 2014: 68 · 2013: 86 · 2012: 65
- FWCI
- 41.36
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- International Journal of Bifurcation and Chaos (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- Surrey Research Insight Open Access (The University of Surrey) (submittedVersion)
- arXiv (Cornell University)
- Topics
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Chaos-based Image/Signal Encryption
- Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Chaos control and synchronization
- Physical Sciences › Computer Science › Computer Networks and Communications › Cryptography and Data Security
- Keywords
- chaos-based cryptosystem, chaos-based cryptography, key management, security analysis, implementation requirements, secure communication, channel noise, bandwidth constraints, signal attenuation
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: SOME BASIC CRYPTOGRAPHIC REQUIREMENTS FOR CHAOS-BASED CRYPTOSYSTEMS. https://app.cochat.ai/papers/10.1142/s0218127406015970
- The paper
- ALVAREZ, G., & LI, S. (2006). SOME BASIC CRYPTOGRAPHIC REQUIREMENTS FOR CHAOS-BASED CRYPTOSYSTEMS. International Journal of Bifurcation and Chaos. https://doi.org/10.1142/s0218127406015970
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.