ON THE DYNAMICAL DEGRADATION OF DIGITAL PIECEWISE LINEAR CHAOTIC MAPS
The DOI matches its Crossref record; 47 of the 47 references it cites were found in a registry or an index.
Abstract
When chaotic systems are realized with finite precisions in digital computers, their dynamical properties are often found to be entirely different from the original versions in the continuous setting. In the literature, there does not seem to be much work on quantitative analysis of such degradation of digitized chaos and how to reduce its negative influence on chaos-based digital systems. Focusing on 1D piecewise linear chaotic maps (PWLCM), this paper reports some findings on a new series of dynamical indicators, which can quantitatively reflect the degradation effects on a digital PWLCM realized with a fixed-point finite precision. On top of that, the paper introduces a new method for studying digital chaos from an algorithmic point of view. In addition, the theoretical results obtained in this paper should be very helpful for the consideration of reducing negative influence of dynamical degradation in real design of various digital chaotic systems. As typical examples, the proposed dynamical indicators are applied to the performance comparison of different remedies for improving dynamical degradation, cryptanalysis of digital chaotic ciphers based on 1D PWLCM, and design of chaotic pseudo-random number generators with desired characteristics.
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
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
The Art of Computer Programming. Volume 2: Seminumerical Algorithms.
Taussky, O., & Knuth, D. E. (1970) · The American Mathematical Monthly · doi:10.2307/2317055 · Cited by 3,822
Equilibrium States and the Ergodic Theory of Anosov Diffeomorphisms
Bowen, R. (1975) · Lecture notes in mathematics · doi:10.1007/bfb0081279 · Cited by 2,773
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×
“Some examples of Type-II discretized chaotic maps can be found in [Fridrich, 1998; Jakimoski & Kocarev, 2001; Kocarev & Jakimoski, 2001; Masuda & Aihara, 2002a,b; Miyamoto et al., 1999; Yano & Tanaka, 2002].”
BackgroundLasota, A., & Mackey, M. C. (1994) · Applied Mathematical Sciences · doi:10.1007/978-1-4612-4286-4 · Cited by 1,353
ON THE DERIVATION OF A “CHAOTIC” ENCRYPTION ALGORITHM
Matthews, R. (1989) · Cryptologia · doi:10.1080/0161-118991863745 · Cited by 1,044
Chaos and cryptography: block encryption ciphers based on chaotic maps
Jakimoski, G., & Kocarev, L. (2001) · IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications · doi:10.1109/81.904880 · Cited by 673
A chaotic direct-sequence spread-spectrum communication system
Heidari-Bateni, G., & McGillem, C. D. (1994) · IEEE Transactions on Communications · doi:10.1109/tcomm.1994.582834 · Cited by 498
Long-time correlations in the stochastic regime
Karney, C. F. F. (1983) · Physica D Nonlinear Phenomena · doi:10.1016/0167-2789(83)90232-4 · Cited by 366
Dachselt, F., & Schwarz, W. (2001) · IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications · doi:10.1109/tcsi.2001.972857 · Cited by 314
A Secret Key Cryptosystem by Iterating a Chaotic Map
Habutsu, T., Nishio, Y., Sasase, I., & Mori, S. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-46416-6_11 · Cited by 268
Cryptosystems with discretized chaotic maps
Masuda, N., & Aihara, K. (2002) · IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications · doi:10.1109/81.974872 · Cited by 265
Shujun, L., Xuanqin, M., & Yuanlong, C. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45311-3_30 · Cited by 232
Logistic map as a block encryption algorithm
Kocarev, L., & Jakimoski, G. (2001) · Physics Letters A · doi:10.1016/s0375-9601(01)00609-0 · Cited by 201
New approach to chaotic encryption
Alvarez, E., Fernández, A., Garcı́a, P., Jiménez, J., & Marcano, A. (1999) · Physics Letters A · doi:10.1016/s0375-9601(99)00747-1 · Cited by 196
CLARIFYING CHAOS: EXAMPLES AND COUNTEREXAMPLES
BROWN, R., & CHUA, L. O. (1996) · International Journal of Bifurcation and Chaos · doi:10.1142/s0218127496000023 · Cited by 169
Li, S., Mou, X., Cai, Y., Ji, Z., & Zhang, J. (2003) · Computer Physics Communications · doi:10.1016/s0010-4655(02)00875-5 · Cited by 164
Self-citationDESIGN OF ONE-DIMENSIONAL CHAOTIC MAPS WITH PRESCRIBED STATISTICAL PROPERTIES
BARANOVSKY, A., & Daems, D. (1995) · International Journal of Bifurcation and Chaos · doi:10.1142/s0218127495001198 · Cited by 153
Improving security of a chaotic encryption approach
Li, S., Mou, X., & Cai, Y. (2001) · Physics Letters A · doi:10.1016/s0375-9601(01)00612-0 · Cited by 136
Self-citationChaotic encryption scheme for real-time digital video:
Li, S., Zheng, X., Mou, X., & Cai, Y. (2002) · SPIE Proceedings · doi:10.1117/12.458527 · Cited by 131
Self-citationPROBLEMS WITH CHAOTIC CRYPTOSYSTEMS
WHEELER, D. D. (1989) · Cryptologia · doi:10.1080/0161-118991863934 · Cited by 125
Arithmetical properties of strongly chaotic motions
Percival, I. C., & Vivaldi, F. (1987) · Physica D Nonlinear Phenomena · doi:10.1016/0167-2789(87)90096-0 · Cited by 117
Perturbance-based algorithmto expand cycle length of chaotic key stream
Tao, S., Ruli, W., & Yixun, Y. (1998) · Electronics Letters · doi:10.1049/el:19980680 · Cited by 117
Roundoff-induced periodicity and the correlation dimension of chaotic attractors
Grebogi, C., Ott, E., & Yorke, J. A. (1988) · Physical Review A · doi:10.1103/physreva.38.3688 · Cited by 116
Analyses and New Designs of Digital Chaotic Ciphers
Li, S. (2003) · University of Surrey Open Research repository · Cited by 106
Self-citationProblems with the chaotic inverse system encryption approach
Zhou, H., & Ling, X. (1997) · IEEE Transactions on Circuits and Systems I Fundamental Theory and Applications · doi:10.1109/81.557386 · Cited by 103
Li, S., Li, Q., Li, W., Mou, X., & Cai, Y. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45325-3_19 · Cited by 81
Self-citationČernák, J. (1996) · Physics Letters A · doi:10.1016/0375-9601(96)00179-x · Cited by 77
Liu, W., & Chen, G. (2004) · International Journal of Bifurcation and Chaos · doi:10.1142/s0218127404009880 · Cited by 75
Self-citationSimulating chaotic behavior with finite-state machines
Binder, P. M., & Jensen, R. V. (1986) · Physical Review A · doi:10.1103/physreva.34.4460 · Cited by 61
On chaos of digital filters in the real world
Lin, T., & Chua, L. O. (1991) · IEEE Transactions on Circuits and Systems · doi:10.1109/31.76495 · Cited by 56
An algorithmic view of pseudochaos
Chirikov, B. V., & Vivaldi, F. (1999) · Physica D Nonlinear Phenomena · doi:10.1016/s0167-2789(98)00319-4 · Cited by 54
Performance analysis of Jakimoski–Kocarev attack on a class of chaotic cryptosystems
Li, S., Mou, X., Ji, Z., Zhang, J., & Cai, Y. (2003) · Physics Letters A · doi:10.1016/s0375-9601(02)01659-6 · Cited by 51
Self-citationGenerating Chaotic Secure Sequences with Desired Statistical Properties and High Security
Hong, Z., & Xieting, L. (1997) · International Journal of Bifurcation and Chaos · doi:10.1142/s0218127497000145 · Cited by 50
Numerical Study of Discrete Plane Area-preserving Mappings
Rannou, F. (1974) · Astronomy and Astrophysics · Cited by 47
Cryptanalysis of a Chaotic Neural Network Based Multimedia Encryption Scheme
Li, C., Li, S., Zhang, D., & Chen, G. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-30543-9_53 · Cited by 45
Self-citationPapadimitriou, S. T., Bountis, T., Mavroudi, S. P., & Bezerianos, A. (2001) · International Journal of Bifurcation and Chaos · doi:10.1142/s0218127401004030 · Cited by 34
Round-off errors andp-adic numbers
Bosio, D., & Vivaldi, F. (1999) · Nonlinearity · doi:10.1088/0951-7715/13/1/315 · Cited by 34
A new block cipher based on chaotic tent maps
Yi, X., Tan, C. H., & Siew, C. K. (2002) · IEEE Transactions on Circuits and Systems I Fundamental Theory and Applications · doi:10.1109/tcsi.2002.805714 · Cited by 34
Limit cycles in a quadratic discrete iteration
Binder, P. M. (1992) · Physica D Nonlinear Phenomena · doi:10.1016/0167-2789(92)90086-3 · Cited by 31
Communication through chaotic map systems
García, P., & Jiménez, J. (2002) · Physics Letters A · doi:10.1016/s0375-9601(02)00382-1 · Cited by 29
DYNAMICAL CHARACTERISTICS OF DISCRETIZED CHAOTIC PERMUTATIONS
Masuda, N., & Aihara, K. (2002) · International Journal of Bifurcation and Chaos · doi:10.1142/s0218127402005686 · Cited by 19
Zhou, L.-H., & Feng, Z. (2000) · IEEE Transactions on Circuits and Systems II Analog and Digital Signal Processing · doi:10.1109/82.877154 · Cited by 19
Chaos for Stream CipherPreprint
Philip, N. S., & Joseph, K. B. (2001) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0102012 · Cited by 16
Truncated Baker transformation and its extension to image encryption
Miyamoto, M., Tanaka, K., & Sugimura, T. (1999) · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · doi:10.1117/12.372751 · Cited by 16
Cryptanalysis of RCES/RSES Image Encryption Scheme.
Li, S., Li, C., Chen, G., et al. (2004) · Surrey Research Insight Open Access (The University of Surrey) · Cited by 15
Self-citationData encryption algorithms using one-dimensional chaotic maps
Jessa, M. (2000) · IEEE International Symposium on Circuits and Systems proceedings · doi:10.1109/iscas.2000.857194 · Cited by 13
Cited by
SOME 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
“…et al. , 2004], estimating parameters via generalized synchronization [Tao et al. , 2003; Tao & Du, 2003], adaptive control/synchronization techniques [Dedieu & Ogorza lek, 1997; Zhou & Lai, 1999; Huang, 2004], correlation analysis [Geddes et al. , 1999], or return maps [Li et al. , 2005d].”
BackgroundMethodResultInfluentialSelf-citation2D 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
Puteaux, P., & Puech, W. (2018) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2018.2799381 · Cited by 396
Dynamic Analysis of Digital Chaotic Maps via State-Mapping Networks
Li, C., Feng, B., Li, S., Kurths, J., & Chen, G. (2019) · IEEE Transactions on Circuits and Systems I: Regular Papers · doi:10.1109/tcsi.2018.2888688 · Cited by 270
Self-citationSelective image encryption using a spatiotemporal chaotic system
Xiang, T., Wong, K.-W., & Liao, X. (2007) · Chaos: An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/1.2728112 · Cited by 193
Metadata
- Authors
- LI, S., CHEN, G., & MOU, X.
- Venue
- International Journal of Bifurcation and Chaos
- Publisher
- World Scientific Pub Co Pte Lt
- Published
- 2005-10
- Volume
- 15
- Issue
- 10
- Pages
- 3119-3151
- ISSN
- 0218-1274 (ISSN-L)
- 1793-6551
- OpenAlex
- W2015304581
- Cited by
- 433
- References
- 47
- FWCI
- 10.37
- 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
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.