X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/16dcc.git/blobdiff_plain/a57f211cb3b73d523ff516e65f2559b296775c11..c9d6a79d174af327059607a3e0a1f23ab7921a49:/conclusion.tex?ds=inline

diff --git a/conclusion.tex b/conclusion.tex
index 0de1fc3..e49ff17 100644
--- 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.
-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 
