Please use this identifier to cite or link to this item: http://hdl.handle.net/1959.13/917278
- Title
- Quantifiers for randomness of chaotic pseudo-random number generators
- Author/Creator
-
De Micco, L.;
Larrondo, H. A.;
Plastino, A.;
Rosso, O. A.
- Institution
- The University of Newcastle. Faculty of Engineering & Built Environment, School of Electrical Engineering and Computer Science
- Description
- We deal with randomness quantifiers and concentrate on their ability to discern the hallmark of chaos in time series used in connection with pseudo-random number generators (PRNGs). 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: (i) which is the best PRNG among the available ones? and (ii) 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.
- Relation
- Philosophical Transactions of the Royal Society A: Mathematical Physical and Engineering Sciences Vol. 367, Issue 1901, p. 3281-3296
- Publisher Link
- http://dx.doi.org/10.1098/rsta.2009.0075
- Date
- 2009
- Publisher
- The Royal Society Publishing
- Keyword(s)
-
random numbers;
statistical complexity;
recurrence plots;
excess entropy;
rate entropy;
permutation entropy
- Resource Type
- journal article
- Identifier
- http://hdl.handle.net/1959.13/917278
- Identifier
- ISSN:1364-503X
- Reviewed
14 Visitors
15 Hits
0 Downloads
