$\Gamma_{\mathcal{P}}(f)$.
The iterated map inside the generator is built by first removing from a
$\mathsf{N}$-cube an Hamiltonian path and next
-adding a self loop to each vertex.
-The PRNG can thus be seen as a random walks of length in $\mathsf{P}$
-into $\mathsf{N}$ this new cube.
-We furthermore have exhibit a bound on the number of iterations
-that are sufficient to obtain a uniform distribution of the output.
+by adding a self loop to each vertex.
+The PRNG can thus be seen as a random walk of length in $\mathsf{P}$
+into this new $\mathsf{N}$-cube.
+We furthermore have exhibited a bound on the number of iterations
+that is sufficient to obtain a uniform distribution of the output.
Finally, experiments through the NIST battery have shown that
the statistical properties are almost established for
$\mathsf{N} = 4, 5, 6, 7, 8$.
investigated too, while other modifications of the hypercube will
be regarded in order to enlarge the set of known chaotic
and random iterations.
+
+%%% Local Variables:
+%%% mode: latex
+%%% TeX-master: "main"
+%%% ispell-dictionary: "american"
+%%% mode: flyspell
+%%% End:
