One-Dimensional Nonlinear Model for Producing Chaos
The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Abstract
Motivated by the concept of circuit design in digital circuit, this paper proposes a one-dimensional (1D) nonlinear model (1D-NLM) for producing 1D discrete-time chaotic maps. Our previous works have designed four nonlinear operations of generating new chaotic maps. However, they focus only on discussing individual nonlinear operations and their properties, but fail to consider their relationship among these operations. The proposed 1D-NLM includes these existing nonlinear operations, develops two new nonlinear operations, discusses their relationship among different nonlinear operations, and investigates the properties of different combinations of these operations. To show the effectiveness of 1D-NLM in generating new chaotic maps, as examples, we provide four new chaotic maps and study their dynamics properties from following three aspects: equilibrium point, stability, and bifurcation diagram. Performance evaluations are provided using the Lyapunov exponent, Shannon entropy, correlation dimension, and initial state sensitivity. The evaluation results show that these new chaotic maps have more complex chaotic behaviors than existing ones. To demonstrate the performance of 1D-NLM in practical applications, we use a pseudo-random number generator (PRNG) to compare new and existing chaotic maps. The randomness test results indicate that new chaotic map generated by 1D-NLM shows better performance than existing ones in designing PRNG.
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
Determining Lyapunov exponents from a time series
Wolf, A., Swift, J. B., Swinney, H. L., & Vastano, J. A. (1985) · Physica D: Nonlinear Phenomena · doi:10.1016/0167-2789(85)90011-9 · Cited by 9,499
Simple mathematical models with very complicated dynamics
May, R. M. (1976) · Nature · doi:10.1038/261459a0 · Cited by 7,001
TestU01: A C library for empirical testing of random number generators
L'Ecuyer, P., & Simard, R. (2007) · ACM Transactions on Mathematical Software · doi:10.1145/1268776.1268777 · Cited by 1,014
A new 1D chaotic system for image encryption
Zhou, Y., Bao, L., & Chen, C. L. P. (2014) · Signal Processing · doi:10.1016/j.sigpro.2013.10.034 · Cited by 859 · cited 3×
“The chaotic behaviors of the cascade, modulation, switching and fusion operations have been analyzed in the previous works in [37]–[40].”
BackgroundMethodSelf-citationChen, Z., Yuan, X., Yuan, Y., Iu, H. H.-C., & Fernando, T. (2016) · IEEE Transactions on Circuits and Systems I: Regular Papers · doi:10.1109/tcsi.2016.2573283 · Cited by 58 · cited 1×
“Recently, many studies are performed to predict chaotic behaviors by estimating their states [20], identifying their chaotic signals [21], [22], or deducing their initial conditions [23], [24].”
Background
Cited by
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
When an attacker meets a cipher-image in 2018: A year in review
Li, C., Zhang, Y., & Xie, E. Y. (2019) · Journal of Information Security and Applications · doi:10.1016/j.jisa.2019.102361 · Cited by 217
“cascading two existing chaotic maps [38]; iteratively expanding a parametric 2-D Cat matrix to any higher dimension [24]; arbitrarily combining six basic nonlinear operations [39]; anti-control [40]; constructing hyperchaotic system [41].”
MethodA novel chaos-based permutation for image encryption
Alawida, M. (2023) · Journal of King Saud University - Computer and Information Sciences · doi:10.1016/j.jksuci.2023.101595 · Cited by 115
“These issues could potentially compromise the security of the image cipher and make it easier to crack (Hua et al., 2018).”
InfluentialDual-Domain Image Encryption in Unsecure Medium—A Secure Communication Perspective
Mahalingam, H., Veeramalai, T., Menon, A. R., S., S., & Amirtharajan, R. (2023) · Mathematics · doi:10.3390/math11020457 · Cited by 73
A secure image encryption scheme with compression-confusion-diffusion structure
Zhu, S., Zhu, C., Fu, Y., Zhang, W., & Wu, X. (2020) · Multimedia Tools and Applications · doi:10.1007/s11042-020-09699-4 · Cited by 19
“Chaotic systems have the properties of ergodic and high sensitivity which can be considered analogous to some ideal cryptographic properties for image encryption [1, 12] and are employed into both permutation and diffusion processes with satisfied efficiency and security.”
Background
Metadata
- Authors
- Hua, Z., & Zhou, Y.
- Venue
- IEEE Transactions on Circuits and Systems I: Regular Papers
- Published
- 2018-01
- Volume
- 65
- Issue
- 1
- Pages
- 235-246
- ISSN
- 1549-8328 (ISSN-L)
- 1558-0806
- OpenAlex
- W2738748671
- Cited by
- 95
- References
- 5
- FWCI
- 2.47
- 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.