X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/16dcc.git/blobdiff_plain/789817c68132962fe415afd50e1105d04fabea47..0c607cc5762637d6a66776808212c498e88d061e:/conclusion.tex

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