Please login to be able to save your searches and receive alerts for new content matching your search criteria.
We are considering the hyperbolic C-K systems of Anosov–Kolmogorov which are defined on high dimensional tori and are used to generate pseudorandom numbers for Monte-Carlo simulations. All trajectories of the C-K systems are exponentially unstable and pseudorandom numbers are represented in terms of coordinates of very long chaotic trajectories. The C-K systems on a torus have countable set of everywhere dense periodic trajectories and their distribution play a crucial role in coding and implementation of the pseudorandom number generator. The asymptotic distribution of chaotic trajectories of C-K systems with periods less than a given number is well known in mathematical literature, but a deviation from its asymptotic behavior is unknown. Using analytical and computer calculations, we are studying a distribution function of periodic trajectories and their deviation from asymptotic behavior. The corresponding MIXMAX generator has the best combination of speed, size of the state and is currently available generator.
Designing a pseudorandom number generator (PRNG) is a difficult and complex task. Many recent works have considered chaotic functions as the basis of built PRNGs: the quality of the output would indeed be an obvious consequence of some chaos properties. However, there is no direct reasoning that goes from chaotic functions to uniform distribution of the output. Moreover, embedding such kind of functions into a PRNG does not necessarily allow to get a chaotic output, which could be required for simulating some chaotic behaviors.
In a previous work, some of the authors have proposed the idea of walking into a N-cube where a balanced Hamiltonian cycle has been removed as the basis of a chaotic PRNG. In this article, all the difficult issues observed in the previous work have been tackled. The chaotic behavior of the whole PRNG is proven. The construction of the balanced Hamiltonian cycle is theoretically and practically solved. An upper bound of the expected length of the walk to obtain a uniform distribution is calculated. Finally practical experiments show that the generators successfully pass the classical statistical tests.