Random Walk in a N-Cube Without Hamiltonian Cycle to Chaotic Pseudorandom Number Generation: Theoretical and Practical Considerations

DOI10.1142/S0218127417500146zbMath1358.11090arXiv1702.02533OpenAlexW2586490810MaRDI QIDQ2973273

Christophe Guyeux, Sylvain Contassot-Vivier, Jean-François Couchot, Pierre-Cyrille Héam

Publication date: 3 April 2017

Published in: International Journal of Bifurcation and Chaos (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1702.02533

zbMATH Keywords

random walkchaotic iterationspseudorandom numbers generator

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Strange attractors, chaotic dynamics of systems with hyperbolic behavior (37D45) Pseudo-random numbers; Monte Carlo methods (11K45)

Related Items (3)

Gray codes generation algorithm and theoretical evaluation of random walks in \(N\)-cubes ⋮ Survey on hardware implementation of random number generators on FPGA: theory and experimental analyses ⋮ Dynamics on binary relations over topological spaces

Uses Software

• MersenneTwister
• TestU01
• Diehard

Cites Work

• Balanced Gray codes
• On the Link between Strongly Connected Iteration Graphs and Chaotic Boolean Discrete-Time Dynamical Systems
• On locally balanced gray codes
• TestU01
• Counting sequences
• On Devaney's Definition of Chaos
• Mersenne twister
• Chaos-based random number generators-part I: analysis [cryptography]
• Chaos-based random number generators. Part II: practical realization
• Probability and Computing
• Unnamed Item
• Unnamed Item

This page was built for publication: Random Walk in a N-Cube Without Hamiltonian Cycle to Chaotic Pseudorandom Number Generation: Theoretical and Practical Considerations