Pseudorandom number generation using chaotic true orbits of the Bernoulli map
- 1 June 2016
- journal article
- conference paper
- Published by AIP Publishing in Chaos: An Interdisciplinary Journal of Nonlinear Science
- Vol. 26 (6) , 063122
Abstract
We devise a pseudorandom number generator that exactly computes chaotic true orbits of the Bernoulli map on quadratic algebraic integers. Moreover, we describe a way to select the initial points (seeds) for generating multiple pseudorandom binary sequences. This selection method distributes the initial points almost uniformly (equidistantly) in the unit interval, and latter parts of the generated sequences are guaranteed not to coincide. We also demonstrate through statistical testing that the generated sequences possess good randomness properties.Keywords
Funding Information
- Japan Society for the Promotion of Science (15K00342)
This publication has 17 references indexed in Scilit:
- On the pass rate of NIST statistical test suite for randomnessJSIAM Letters, 2010
- A new multidimensional continued fraction algorithmMathematics of Computation, 2009
- Correction of Overlapping Template Matching Test Included in NIST Randomness Test SuiteIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2007
- Computational Aspects of a Modified Bernoulli MapProgress of Theoretical Physics Supplement, 2006
- The Distribution of the Spectrum for the Discrete Fourier Transform Test Included in SP800-22IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2005
- On Finite Pseudorandom Binary SequencesJournal of Number Theory, 1998
- Mersenne twisterACM Transactions on Modeling and Computer Simulation, 1998
- Dynamics over irreducible polynomialsNonlinearity, 1992
- Simulating chaotic behavior with finite-state machinesPhysical Review A, 1986
- Ergodic maps on [0, 1] and nonlinear pseudo-random number generatorsNonlinear Analysis, 1978