pch

[16dcc.git] / conclusion.tex

diff --git a/conclusion.tex b/conclusion.tex
index a9bf6364160a8485b4009b1fe6eda6ff36f96866..2705043fe2335fd223c705c26e86b2bc2409800a 100644 (file)
--- a/conclusion.tex
+++ b/conclusion.tex
@@ -14,11 +14,11 @@ applied here to generate function $f$ with strongly connected
 $\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 
 $\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$.
 Finally,  experiments through the  NIST battery have shown that
 the statistical properties are almost established for
 $\mathsf{N} = 4, 5, 6, 7, 8$.