Chaos-based random number generators-part I: analysis [cryptography]
Abstract
This paper and its companion (Part II) are devoted to the analysis of the application of a chaotic piecewise-linear one-dimensional (PL1D) map as random number generator (RNG). Piecewise linearity of the map enables us to mathematically find parameter values for which a generating partition is Markov and the RNG behaves as a Markov information source, and then to mathematically analyze the information generation process and the RNG. In the companion paper we discuss practical aspects of our chaos-based RNGs.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
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?
Chaos is a perfect entropy source for fast TRNGs due to high bandwidth, unpredictability, and insensitivity to disturbance and component tolerances.
“Due to its high bandwidth, unpredictability and insensitive to various disturbance and tolerances of components, chaos is a perfect entropy source for fast TRNGs [14], [76], [77].”
From True Random Number Generators Using Electrical Noise (2019) · cites this paper as [14]
The citation lists haven’t been fetched yet
References 35 · Cited by 371
- Authors
- Stojanovski, T., & Kocarev, L.
- Affiliations
- University of California System (US)
- ORCID
- Kocarev, L.
- Venue
- IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications
- Published
- 2001-03
- Volume
- 48
- Issue
- 3
- Pages
- 281-288
- ISSN
- 1057-7122 (ISSN-L)
- OpenAlex
- W2081024858
- Cited by
- 371
- References
- 35
- Citations by year
- 2026: 8 · 2025: 10 · 2024: 7 · 2023: 5 · 2022: 6 · 2021: 17 · 2020: 18 · 2019: 28 · 2018: 16 · 2017: 30 · 2016: 15 · 2015: 23 · 2014: 19 · 2013: 13 · 2012: 14
- FWCI
- 9.07
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- IEEE Transactions on Circuits and Systems I Fundamental Theory and Applications (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Chaos-based Image/Signal Encryption
- Physical Sciences › Mathematics › Mathematical Physics › Mathematical Dynamics and Fractals
- Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Chaos control and synchronization
- Keywords
- piecewise linear maps, one-dimensional maps, Markov partitions, information generation, random number generation
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
