title: Quantifiers for randomness of chaotic pseudo-random number generators.
abstract: 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.
authors.affiliation: Departamentos de Física y de Ingeniería Electrónica, Facultad de Ingeniería, Universidad Nacional de Mar del Plata, Juan B. Justo 4302, 7600 Mar del Plata, Argentina.
authors.forename: L
authors.initials: L
authors.lastname: De Micco
authors.forename: H A
authors.initials: HA
authors.lastname: Larrondo
authors.forename: A
authors.initials: A
authors.lastname: Plastino
authors.forename: O A
authors.initials: OA
authors.lastname: Rosso
mesh_terms: D017711:Nonlinear Dynamics; D013997:Time Factors