Quantifiers for randomness of chaotic pseudo-random number generators
From MaRDI portal
Abstract: We deal with randomness-quantifiers and concentrate on their ability do discern the hallmark of chaos in time-series used in connection with pseudo random number generators (PRNG). Workers in the field are motivated to use chaotic maps for generating PRNGs because of the simplicity of their implementation. Although there exist very efficient general-purpose benchmarks for testing PRNGs, we feel that the analysis provided here sheds additional didactic light on the importance of the main statistical characteristics of a chaotic map, namely, i) its invariant measure and ii) the mixing constant. This is of help in answering two questions that arise in applications, that is, (1) which is the best PRNG among the available ones? and (2) If a given PRNG turns out not to be good enough and a randomization procedure must still be applied to it, which is the best applicable randomization procedure?. Our answer provides a comparative analysis of several quantifiers advanced in the extant literature.
Recommendations
- Chaos-based random number generators-part I: analysis [cryptography]
- A new pseudo-random number generator based on two chaotic maps
- Pseudo random number generator based on quantum chaotic map
- scientific article; zbMATH DE number 2051018
- Digitized Chaos for Pseudo-random Number Generation in Cryptography
Cites work
- A comparative classification of complexity measures
- Bandt-Pompe approach to the classical-quantum transition
- Chaos-based random number generators-part I: analysis [cryptography]
- CLARIFYING CHAOS: EXAMPLES AND COUNTEREXAMPLES
- Discrete entropy
- Encryption test of pseudo-aleatory messages embedded on chaotic laser signals: an information theory approach
- Ergodic properties of a kicked damped particle
- Masking properties of APD communication systems
- Permutation entropy of fractional Brownian motion and fractional Gaussian noise
- Pseudorandom bits generated by chaotic maps
- Random number generators and causality
- Statistical complexity and disequilibrium
- STOCHASTIC VERSIONS OF ANOSOV'S AND NEISTADT'S THEOREMS ON AVERAGING
- Symbolic Analysis of High-Dimensional Time Series
- Synchronization in chaotic systems
- Uniform random number generation
Cited in
(16)- Measuring the jitter of ring oscillators by means of information theory quantifiers
- A visual analysis method of randomness for classifying and ranking pseudo-random number generators
- Random property enhancement of a 1D chaotic PRNG with finite precision implementation
- Spectrum and entropy of C-systems MIXMAX random number generator
- Random Walk in a N-Cube Without Hamiltonian Cycle to Chaotic Pseudorandom Number Generation: Theoretical and Practical Considerations
- Pseudo random number generator based on quantum chaotic map
- scientific article; zbMATH DE number 4205848 (Why is no real title available?)
- From chaos to randomness via geometric undersampling
- Permutation entropy and its main biomedical and econophysics applications: a review
- scientific article; zbMATH DE number 2051018 (Why is no real title available?)
- Improving the pseudo-randomness properties of chaotic maps using deep-zoom
- Bandt-Pompe symbolization dynamics for time series with tied values: a data-driven approach
- NIST tests, Lyapunov exponents and bifurcation diagrams when evaluating chaos-based pRNGs
- White Noise Test from Ordinal Patterns in the Entropy–Complexity Plane
- Discrete asymptotic deterministic randomness for the generation of pseudorandom bits
- Evidence of the correlation between positive Lyapunov exponents and good chaotic random number sequences
This page was built for publication: Quantifiers for randomness of chaotic pseudo-random number generators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3559919)
