Traversing a n-cube without Balanced Hamiltonian Cycle to Generate Pseudorandom Numbers
Data Structures and Algorithms
2017-06-28 v1
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.
Cite
@article{arxiv.1706.08923,
title = {Traversing a n-cube without Balanced Hamiltonian Cycle to Generate Pseudorandom Numbers},
author = {Jean-François Couchot and Pierre-Cyrille Heam and Christophe Guyeux and Qianxue Wang and Jacques M. Bahi},
journal= {arXiv preprint arXiv:1706.08923},
year = {2017}
}