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
