Traversing a n-cube without Balanced Hamiltonian Cycle to Generate Pseudorandom Numbers

2017/06/26 by Couchot, Jean-François, Heam, Pierre-Cyrille, Guyeux, Christophe +2
#Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences

paper · doi:10.48550/arxiv.1706.08923

Abstract

This article presents a new class of Pseudorandom Number Generators. The generators are based on traversing a n-cube where a Balanced Hamiltonian Cycle has been removed. The construction of such generators is automatic for small number of bits, but remains an open problem when this number becomes large. A running example is used throughout the paper. Finally, first statistical experiments of these generators are presented, they show how efficient and promising the proposed approach seems.

Related

• A Simple construction of the Pseudorandom Generator from Permutation
• Unveiling patterns in xorshift128+ pseudorandom number generators
• Better Pseudorandom Generators from Milder Pseudorandom Restrictions
• Bit recycling for scaling random number generators
• A Search for Good Pseudo-random Number Generators : Survey and Empirical Studies