1 \begin{block}{Motivation}
2 Automatically generating a large class of PRNGs
3 with chaos and statistical properties
6 \begin{exampleblock}{Previous work}
7 To provide a PRNG with the properties of Devaney's chaos and of succeeding NIST test: a (non-chaotic) PRNG + iterating a Boolean maps\footnote{J. Bahi, J.-F. Couchot, C. Guyeux, and A. Richard.
8 \newblock On the link between strongly connected iteration graphs and chaotic
9 Boolean discrete-time dynamical systems, {\em
10 Fundamentals of Computation Theory}, volume 6914 of {\em Lecture Notes in
11 Computer Science}, pages 126--137. Springer Berlin Heidelberg, 2011.}:
13 \item with strongly connected iteration graph
14 \item with doubly stochastic Markov probability matrix