quelques corrections après remarques de Sylvain

[16dcc.git] / conclusion.tex

diff --git a/conclusion.tex b/conclusion.tex
index 0de1fc3040849c80f3e38688d96b00902ebfb2e3..e49ff176c5ddb133176714dc3343d5a3676db581 100644 (file)
--- a/conclusion.tex
+++ b/conclusion.tex
@@ -21,8 +21,10 @@ into  this new $\mathsf{N}$-cube.
 We have exhibit an efficient method to compute such a balanced Hamiltonian 
 cycle. This method is an algebraic solution of an undeterministic 
 approach~\cite{ZanSup04} and has a low complexity.
 We have exhibit an efficient method to compute such a balanced Hamiltonian 
 cycle. This method is an algebraic solution of an undeterministic 
 approach~\cite{ZanSup04} and has a low complexity.

-Thanks to this solution, many chaotic functions can be generated.
-
+According to the author knowledge, this is the first time a full 
+automatic method to provide chaotic PRNGs is given.  
+Practically speaking, this approach preserves the security properties of 
+the embedded PRNG, even if it remains quite cost expensive.

 
 
 We furthermore have exhibited a upper bound on the number of iterations 
 
 
 We furthermore have exhibited a upper bound on the number of iterations