2 \begin{block}{Mixing Time}
3 The smallest iteration number that is sufficient to obtain
4 a deviation lesser $\varepsilon$ between rows of $M$ and a given distribution.
7 \begin{block}{PRNG $\chi_{\textit{14Secrypt}}$}
10 \KwIn{a function $f$, an iteration number $b$, a \textit{Random} PRNG, an initial configuration $x^0$ ($n$ bits)}
11 \KwOut{a configuration $x$ ($n$ bits)}
15 $s\leftarrow{\textit{Random}(n)}$\;
16 $x\leftarrow{F_f(s,x)}$\;
22 \item From $x^0$: a random walk in $\Gamma(f)$ thanks to \textit{Random}