Pseudorandom number generator based on the Bernoulli map on cubic algebraic integers
This provides a new pseudorandom number generator for applications requiring high-quality randomness, but it is incremental as it builds on existing chaotic map methods.
The paper tackles the problem of generating pseudorandom binary sequences by using the Bernoulli map on cubic algebraic integers, achieving good statistical properties and an advantage over the Mersenne Twister MT19937.
We develop a method for generating pseudorandom binary sequences using the Bernoulli map on cubic algebraic integers. The distinguishing characteristic of our generator is that it generates chaotic true orbits of the Bernoulli map by exact computation. In particular, we clarify a way to properly prepare a set of initial points (i.e., seeds), which is needed when generating multiple pseudorandom sequences. With this seed selection method, we can distribute the initial points almost uniformly in the unit interval and can also guarantee that the orbits starting from them do not merge. We also report results of a large variety of tests indicating that the generated pseudorandom sequences have good statistical properties as well as an advantage over what is probably the most popular generator, the Mersenne Twister MT19937.