allows to get a chaotic output, which could be required for simulating
some chaotic behaviours.
-In a previous work, some of the authors have proposed the idea of walking into a
-$\mathsf{N}$-cube where a balanced Hamiltonian cycle have 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.
-A upper bound of the length of the walk to obtain a uniform distribution is calculated.
-Finally practical experiments show that the generators successfully pass
-the classical statistical tests.
+In a previous work, some of the authors have proposed the idea of walking
+into a $\mathsf{N}$-cube where a balanced Hamiltonian cycle have 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.
\end{abstract}
