4 \usepackage{subcaption}
8 %\usepackage[font=footnotesize]{subfig}
11 \usepackage{algorithm2e}
13 %\usepackage{ntheorem}
15 \usepackage[utf8]{inputenc}
16 \usepackage[T1]{fontenc}
17 \usepackage[english]{babel}
18 \usepackage{amsmath,amssymb,latexsym,eufrak,euscript}
19 \usepackage{pstricks,pst-node,pst-coil}
23 \usepackage{pgflibrarysnakes}
27 \usetikzlibrary{arrows}
28 \usetikzlibrary{automata}
29 \usetikzlibrary{snakes}
30 \usetikzlibrary{shapes}
33 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
34 % Définitions personnelles
35 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
37 \definecolor{bleuclair}{rgb}{0.75,0.75,1.0}
38 \newcommand{\ANNOT}[1]{
42 \large\fcolorbox{black}{bleuclair}{
43 \begin{minipage}[h]{.8\linewidth}
53 \newcommand {\tv}[1] {\lVert #1 \rVert_{\rm TV}}
58 \def \ts {\tau_{\rm stop}}
61 \newtheorem*{xpl}{Running Example}
63 \newcommand{\vectornorm}[1]{\ensuremath{\left|\left|#1\right|\right|_2}}
64 %\newcommand{\ie}{\textit{i.e.}}
65 \newcommand{\Nats}[0]{\ensuremath{\mathbb{N}}}
66 \newcommand{\R}[0]{\ensuremath{\mathbb{R}}}
67 \newcommand{\Z}[0]{\ensuremath{\mathbb{Z}}}
68 \newcommand{\Bool}[0]{\ensuremath{\mathds{B}}}
69 \newcommand{\rel}[0]{\ensuremath{{\mathcal{R}}}}
70 \newcommand{\Gall}[0]{\ensuremath{\mathcal{G}}}
73 \newcommand{\JFC}[1]{\begin{color}{green}\textit{#1}\end{color}}
74 \newcommand{\CG}[1]{\begin{color}{blue}\textit{}\end{color}}
75 \newcommand{\og}[0]{``}
76 \newcommand{\fg}[1]{''}
83 \title{Random Walk in a N-cube Without Hamiltonian Cycle
84 to Chaotic Pseudorandom Number Generation: Theoretical and Practical
89 \author{Sylvain Contassot-Vivier, Jean-François Couchot, Christophe Guyeux, Pierre-Cyrille Heam}
90 \address{LORIA, Université de Lorraine, Nancy, France\\
91 FEMTO-ST Institute, University of Franche-Comté, Belfort, France}
93 \keywords{Pseudorandom Number Generator, Theory of Chaos, Markov Matrice, Hamiltonian Path, Stopping Time, Statistical Test}
95 \subjclass{34C28, 37A25,11K45}
98 This paper is dedicated to the design of chaotic random generators
99 and extends previous works proposed by some of the authors.
100 We propose a theoretical framework proving both the chaotic properties and
101 that the limit distribution is uniform.
102 A theoretical bound on the stationary time is given and
103 practical experiments show that the generators successfully pass
104 the classical statistical tests.
109 \section{Introduction}
112 \section{Preliminaries}\label{sec:preliminaries}
113 \input{preliminaries}
115 \section{Proof Of Chaos}\label{sec:proofOfChaos}
118 \section{Functions with Strongly Connected $\Gamma_{\{b\}}(f)$}\label{sec:SCCfunc}
121 \section{Balanced Hamiltonian Cycle}\label{sec:hamilton}
125 \section{Mixing Time}\label{sec:hypercube}
128 \section{Experiments}\label{sec:prng}
136 %\acknowledgements{...}
138 \bibliographystyle{alpha}
139 \bibliography{biblio}
145 %%% ispell-dictionary: "american"