From 039eee12186be85d7a74a188489abd12bfe554fd Mon Sep 17 00:00:00 2001 From: Christophe Guyeux Date: Fri, 20 Feb 2015 16:35:08 +0100 Subject: [PATCH] MAJ des citations et des sections --- biblio.bib | 81 ++++++++++++++++++++++++++++++++++++++++++++++++++++ main.tex | 7 +++-- stopping.tex | 2 +- 3 files changed, 86 insertions(+), 4 deletions(-) diff --git a/biblio.bib b/biblio.bib index d8269e8..6cdde3f 100644 --- a/biblio.bib +++ b/biblio.bib @@ -970,3 +970,84 @@ Pierre-Cyrille, and Wang, Qianxue and Bahi, Jacques}, bibsource = {dblp computer science bibliography, http://dblp.org} } + +@INPROCEEDINGS{wbg10:ip, + author = {Wang, Qianxue and Bahi, Jacques and Guyeux, Christophe and Fang, + Xiaole}, + title = {Randomness quality of {CI} chaotic generators. Application to Internet + security}, + booktitle = {INTERNET'2010. The 2nd Int. Conf. on Evolving Internet}, + year = {2010}, + pages = {125--130}, + address = {Valencia, Spain}, + month = sep, + publisher = {IEEE Computer Society Press}, + note = {Best Paper award}, + classement = {ACTI}, + doi = {10.1109/INTERNET.2010.30}, + domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO}, + equipe = {and}, + inhal = {no}, + url = {http://doi.ieeecomputersociety.org/10.1109/INTERNET.2010.30} +} + + + + + + + +@INPROCEEDINGS{bgw09:ip, + author = {Bahi, Jacques and Guyeux, Christophe and Wang, Qianxue}, + title = {A novel pseudo-random generator based on discrete chaotic iterations}, + booktitle = {INTERNET'09, 1-st Int. Conf. on Evolving Internet}, + year = {2009}, + pages = {71--76}, + address = {Cannes, France}, + month = aug, + classement = {ACTI}, + doi = {10.1109/INTERNET.2009.18}, + domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO}, + equipe = {and}, + inhal = {no}, + url = {http://dx.doi.org/10.1109/INTERNET.2009.18} +} + + + + +@INPROCEEDINGS{bcgr11:ip, + author = {Bahi, Jacques and Couchot, Jean-Fran\c{c}ois and Guyeux, Christophe + and Richard, Adrien}, + title = {On the Link Between Strongly Connected Iteration Graphs and Chaotic + Boolean Discrete-Time Dynamical Systems}, + booktitle = {FCT'11, 18th Int. Symp. on Fundamentals of Computation Theory}, + year = {2011}, + volume = {6914}, + series = {LNCS}, + pages = {126--137}, + address = {Oslo, Norway}, + month = aug, + classement = {ACTI}, + doi = {10.1007/978-3-642-22953-4_11}, + domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO}, + equipe = {and}, + inhal = {no}, + url = {http://dx.doi.org/10.1007/978-3-642-22953-4_11} +} + + + + +@ARTICLE{DBLP:journals/corr/abs-1112-5239, + author = {Jacques M. Bahi and Rapha{\"e}l Couturier and Christophe Guyeux and + Pierre-Cyrille H{\'e}am}, + title = {Efficient and Cryptographically Secure Generation of Chaotic Pseudorandom + Numbers on GPU}, + journal = {CoRR}, + year = {2011}, + volume = {abs/1112.5239}, + bibsource = {DBLP, http://dblp.uni-trier.de}, + ee = {http://arxiv.org/abs/1112.5239} +} + diff --git a/main.tex b/main.tex index bc8bb20..a934599 100644 --- a/main.tex +++ b/main.tex @@ -70,6 +70,7 @@ % \theoremseparator{} % \theoremsymbol{\rule{1ex}{1ex}} \newtheorem{Proof}{Proof} +\newtheorem{proposition}{Proposition} \newtheorem{xpl}{Running Example} \newcommand{\vectornorm}[1]{\ensuremath{\left|\left|#1\right|\right|_2}} @@ -123,7 +124,7 @@ may be updated at each iteration. At the theoretical level, we show that \section{Proof Of Chaos} - +\input{chaos} \section{Random walk on the modified Hypercube} @@ -132,7 +133,7 @@ may be updated at each iteration. At the theoretical level, we show that % Donner la borne du stopping time quand on marche dedans (nouveau). % Énoncer le problème de la taille de cette borne (elle est certes finie, mais grande). -\section{Proofs of Chaos in this context} + \section{Quality study of the strategy} @@ -140,7 +141,7 @@ may be updated at each iteration. At the theoretical level, we show that \section{Application to Pseudorandom Number Generation} -\input{prng} +%\input{prng} \section{Conclusion} %\input{conclusion} diff --git a/stopping.tex b/stopping.tex index 19f1feb..d095a3a 100644 --- a/stopping.tex +++ b/stopping.tex @@ -246,4 +246,4 @@ Theorem~\ref{prop:stop} is a direct application of lemma~\ref{prop:lambda} and~\ref{lm:stopprime}. \end{proof} -\end{document} + -- 2.39.5