Relecture jusqu'à la page 9.

diff --git a/mabase.bib b/mabase.bib
index 16ad9f69ad4d41fa6cb5d9167e033dd659be5489..aa9224d3a81bd6d370f6f591dabad4dc4cc2e249 100644 (file)
--- a/mabase.bib
+++ b/mabase.bib
@@ -754,7 +754,7 @@
 }
 
 @INPROCEEDINGS{bcgr11:ip,
 }
 
 @INPROCEEDINGS{bcgr11:ip,

-  author = {Bahi, Jacques and Couchot, Jean-fran\c{c}ois and Guyeux, Christophe
+  author = {Bahi, Jacques M. 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},
        and Richard, Adrien},
   title = {On the Link Between Strongly Connected Iteration Graphs and Chaotic
        Boolean Discrete-Time Dynamical Systems},


@@ -773,7 +773,7 @@
 }
 
 @ARTICLE{bg10:ij,
 }
 
 @ARTICLE{bg10:ij,

-  author = {Bahi, Jacques and Guyeux, Christophe},
+  author = {Bahi, Jacques M. and Guyeux, Christophe},

   title = {Hash Functions Using Chaotic Iterations},
   journal = {Journal of Algorithms \& Computational Technology},
   year = {2010},
   title = {Hash Functions Using Chaotic Iterations},
   journal = {Journal of Algorithms \& Computational Technology},
   year = {2010},


@@ -791,7 +791,7 @@
 }
 
 @INPROCEEDINGS{guyeux10ter,
 }
 
 @INPROCEEDINGS{guyeux10ter,

-  author = {Bahi, Jacques and Guyeux, Christophe},
+  author = {Bahi, Jacques M. and Guyeux, Christophe},

   title = {A new chaos-based watermarking algorithm},
   booktitle = {SECRYPT'10, Int. conf. on security and cryptography},
   year = {2010},
   title = {A new chaos-based watermarking algorithm},
   booktitle = {SECRYPT'10, Int. conf. on security and cryptography},
   year = {2010},


@@ -806,7 +806,7 @@
 }
 
 @INPROCEEDINGS{bgc11:ip,
 }
 
 @INPROCEEDINGS{bgc11:ip,

-  author = {Bahi, Jacques and Guyeux, Christophe and Cote, Nathalie},
+  author = {Bahi, Jacques M. and Guyeux, Christophe and Cote, Nathalie},

   title = {Chaos of Protein Folding},
   booktitle = {IJCNN 2011, Int. Joint Conf. on Neural Networks},
   year = {2011},
   title = {Chaos of Protein Folding},
   booktitle = {IJCNN 2011, Int. Joint Conf. on Neural Networks},
   year = {2011},


@@ -821,7 +821,7 @@
 }
 
 @INPROCEEDINGS{guyeux10bis,
 }
 
 @INPROCEEDINGS{guyeux10bis,

-  author = {Bahi, Jacques and Guyeux, Christophe and Makhoul, Abdallah},
+  author = {Bahi, Jacques M. and Guyeux, Christophe and Makhoul, Abdallah},

   title = {Efficient and Robust Secure Aggregation of Encrypted Data in Sensor
        Networks},
   booktitle = {SENSORCOMM'10, 4-th Int. Conf. on Sensor Technologies and Applications},
   title = {Efficient and Robust Secure Aggregation of Encrypted Data in Sensor
        Networks},
   booktitle = {SENSORCOMM'10, 4-th Int. Conf. on Sensor Technologies and Applications},


@@ -838,7 +838,7 @@
 }
 
 @INPROCEEDINGS{guyeuxVictoria,
 }
 
 @INPROCEEDINGS{guyeuxVictoria,

-  author = {Bahi, Jacques and Guyeux, Christophe and Makhoul, Abdallah},
+  author = {Bahi, Jacques M. and Guyeux, Christophe and Makhoul, Abdallah},

   title = {Secure Data Aggregation in Wireless Sensor Networks. Homomorphism
        versus Watermarking Approach},
   booktitle = {ADHOCNETS 2010, 2nd Int. Conf. on Ad Hoc Networks},
   title = {Secure Data Aggregation in Wireless Sensor Networks. Homomorphism
        versus Watermarking Approach},
   booktitle = {ADHOCNETS 2010, 2nd Int. Conf. on Ad Hoc Networks},


@@ -857,7 +857,7 @@
 }
 
 @INPROCEEDINGS{bgs11:ip,
 }
 
 @INPROCEEDINGS{bgs11:ip,

-  author = {Bahi, Jacques and Guyeux, Christophe and Salomon, Michel},
+  author = {Bahi, Jacques M. and Guyeux, Christophe and Salomon, Michel},

   title = {Building a Chaotic Proven Neural Network},
   booktitle = {ICCANS 2011, IEEE Int. Conf. on Computer Applications and Network
        Security},
   title = {Building a Chaotic Proven Neural Network},
   booktitle = {ICCANS 2011, IEEE Int. Conf. on Computer Applications and Network
        Security},


@@ -872,7 +872,7 @@
 }
 
 @INPROCEEDINGS{bgw10:ip,
 }
 
 @INPROCEEDINGS{bgw10:ip,

-  author = {Bahi, Jacques and Guyeux, Christophe and Wang, Qianxue},
+  author = {Bahi, Jacques M. and Guyeux, Christophe and Wang, Qianxue},

   title = {A Pseudo Random Numbers Generator Based on Chaotic Iterations. Application
        to Watermarking},
   booktitle = {WISM 2010, Int. Conf. on Web Information Systems and Mining},
   title = {A Pseudo Random Numbers Generator Based on Chaotic Iterations. Application
        to Watermarking},
   booktitle = {WISM 2010, Int. Conf. on Web Information Systems and Mining},


@@ -891,7 +891,7 @@
 }
 
 @INPROCEEDINGS{bgw09:ip,
 }
 
 @INPROCEEDINGS{bgw09:ip,

-  author = {Bahi, Jacques and Guyeux, Christophe and Wang, Qianxue},
+  author = {Bahi, Jacques M. 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},
   title = {A novel pseudo-random generator based on discrete chaotic iterations},
   booktitle = {INTERNET'09, 1-st Int. Conf. on Evolving Internet},
   year = {2009},


@@ -905,7 +905,7 @@
 }
 
 @INPROCEEDINGS{bmg10:onp,
 }
 
 @INPROCEEDINGS{bmg10:onp,

-  author = {Bahi, Jacques and Makhoul, Abdallah and Guyeux, Christophe},
+  author = {Bahi, Jacques M. and Makhoul, Abdallah and Guyeux, Christophe},

   title = {Efficient and Robust Secure Aggregation of Encrypted Data in Sensor
        Networks for critical applications},
   booktitle = {RESSACS, Journ\'ee th\'ematique PHC/ResCom sur RESeaux de capteurS
   title = {Efficient and Robust Secure Aggregation of Encrypted Data in Sensor
        Networks for critical applications},
   booktitle = {RESSACS, Journ\'ee th\'ematique PHC/ResCom sur RESeaux de capteurS


@@ -921,7 +921,7 @@
 }
 
 @INPROCEEDINGS{guyeuxBayonne,
 }
 
 @INPROCEEDINGS{guyeuxBayonne,

-  author = {Bahi, Jacques and Makhoul, Abdallah and Guyeux, Christophe},
+  author = {Bahi, Jacques M. and Makhoul, Abdallah and Guyeux, Christophe},

   title = {Efficient and Robust Secure Aggregation of Encrypted Data in Sensor
        Networks for critical applications},
   booktitle = {RESSACS, Journ\'ee th\'ematique PHC/ResCom sur RESeaux de capteurS
   title = {Efficient and Robust Secure Aggregation of Encrypted Data in Sensor
        Networks for critical applications},
   booktitle = {RESSACS, Journ\'ee th\'ematique PHC/ResCom sur RESeaux de capteurS


@@ -936,7 +936,7 @@
 }
 
 @ARTICLE{bs10:ij,
 }
 
 @ARTICLE{bs10:ij,

-  author = {Bahi, Jacques and Salomon, Michel},
+  author = {Bahi, Jacques M. and Salomon, Michel},

   title = {A Decentralized Energy-based Diffusion Algorithm to Increase the
        Lifetime of {MANETs}},
   journal = {Computer Networks Journal},
   title = {A Decentralized Energy-based Diffusion Algorithm to Increase the
        Lifetime of {MANETs}},
   journal = {Computer Networks Journal},


@@ -3034,6 +3034,14 @@
   timestamp = {2009.11.09}
 }
 
   timestamp = {2009.11.09}
 }
 

+@ARTICLE{Simard07testu01:a,
+    author = {Richard Simard and Université De Montréal},
+    title = {TestU01: A C library for empirical testing of random number generators},
+    journal = {ACM Transactions on Mathematical Software},
+    year = {2007},
+    pages = {2007}
+}
+

 @ARTICLE{DefiningChaos,
   author = {M. Martelli and M. Dang and T. Seph},
   title = {Defining chaos},
 @ARTICLE{DefiningChaos,
   author = {M. Martelli and M. Dang and T. Seph},
   title = {Defining chaos},


@@ -3675,7 +3683,7 @@
 }
 
 @INPROCEEDINGS{wbg10:ip,
 }
 
 @INPROCEEDINGS{wbg10:ip,

-  author = {Wang, Qianxue and Bahi, Jacques and Guyeux, Christophe and Fang,
+  author = {Wang, Qianxue and Bahi, Jacques M. and Guyeux, Christophe and Fang,

        Xiaole},
   title = {Randomness quality of {CI} chaotic generators. Application to Internet
        security},
        Xiaole},
   title = {Randomness quality of {CI} chaotic generators. Application to Internet
        security},

diff --git a/prng_gpu.tex b/prng_gpu.tex
index ada74d4d9230ef7321b78df4bc8084b3d1fcd26e..84efafa5443f23f4504a723320ec63e7c2f36b49 100644 (file)
--- a/prng_gpu.tex
+++ b/prng_gpu.tex
@@ -109,7 +109,7 @@ Let us finish this paragraph by noticing that, in this paper,
 statistical perfection refers to the ability to pass the whole 
 {\it BigCrush} battery of tests, which is widely considered as the most
 stringent statistical evaluation of a sequence claimed as random.
 statistical perfection refers to the ability to pass the whole 
 {\it BigCrush} battery of tests, which is widely considered as the most
 stringent statistical evaluation of a sequence claimed as random.

-This battery can be found into the well-known TestU01 package.
+This battery can be found into the well-known TestU01 package~\cite{LEcuyerS07}.

 Chaos, for its part, refers to the well-established definition of a
 chaotic dynamical system proposed by Devaney~\cite{Devaney}.
 
 Chaos, for its part, refers to the well-established definition of a
 chaotic dynamical system proposed by Devaney~\cite{Devaney}.
 


@@ -118,7 +118,7 @@ In a previous work~\cite{bgw09:ip,guyeux10} we have proposed a post-treatment on
 as a chaotic dynamical system. Such a post-treatment leads to a new category of
 PRNGs. We have shown that proofs of Devaney's chaos can be established for this
 family, and that the sequence obtained after this post-treatment can pass the
 as a chaotic dynamical system. Such a post-treatment leads to a new category of
 PRNGs. We have shown that proofs of Devaney's chaos can be established for this
 family, and that the sequence obtained after this post-treatment can pass the

-NIST, DieHARD, and TestU01 batteries of tests, even if the inputted generators
+NIST~\cite{Nist10}, DieHARD~\cite{Marsaglia1996}, and TestU01~\cite{LEcuyerS07} batteries of tests, even if the inputted generators

 cannot.
 The proposition of this paper is to improve widely the speed of the formerly
 proposed generator, without any lack of chaos or statistical properties.
 cannot.
 The proposition of this paper is to improve widely the speed of the formerly
 proposed generator, without any lack of chaos or statistical properties.


@@ -431,10 +431,11 @@ As $G_f$, defined on the domain   $\llbracket 1 ;  \mathsf{N} \rrbracket^{\mathd
 \rightarrow \mathds{B}^\mathsf{N}$, we can preserve the theoretical properties on $G_f$
 during implementations (due to the discrete nature of $f$). It is as if
 $\mathds{B}^\mathsf{N}$ represents the memory of the computer whereas $\llbracket 1 ;  \mathsf{N}
 \rightarrow \mathds{B}^\mathsf{N}$, we can preserve the theoretical properties on $G_f$
 during implementations (due to the discrete nature of $f$). It is as if
 $\mathds{B}^\mathsf{N}$ represents the memory of the computer whereas $\llbracket 1 ;  \mathsf{N}

-\rrbracket^{\mathds{N}}$ is its input stream (the seeds, for instance).
+\rrbracket^{\mathds{N}}$ is its input stream (the seeds, for instance, in PRNG, or a physical noise in TRNG).

 
 \section{Application to pseudorandomness}
 \label{sec:pseudorandom}
 
 \section{Application to pseudorandomness}
 \label{sec:pseudorandom}

+

 \subsection{A First pseudorandom Number Generator}
 
 We have proposed in~\cite{bgw09:ip} a new family of generators that receives 
 \subsection{A First pseudorandom Number Generator}
 
 We have proposed in~\cite{bgw09:ip} a new family of generators that receives 


@@ -480,7 +481,7 @@ return $y$\;
 
 
 This generator is synthesized in Algorithm~\ref{CI Algorithm}.
 
 
 This generator is synthesized in Algorithm~\ref{CI Algorithm}.

-It takes as input: a function $f$;
+It takes as input: a Boolean function $f$ satisfying Theorem~\ref{Th:Caractérisation   des   IC   chaotiques};

 an integer $b$, ensuring that the number of executed iterations is at least $b$
 and at most $2b+1$; and an initial configuration $x^0$.
 It returns the new generated configuration $x$.  Internally, it embeds two
 an integer $b$, ensuring that the number of executed iterations is at least $b$
 and at most $2b+1$; and an initial configuration $x^0$.
 It returns the new generated configuration $x$.  Internally, it embeds two


@@ -505,7 +506,7 @@ We have proven in \cite{bcgr11:ip} that,
   if and only if $M$ is a double stochastic matrix.
 \end{theorem} 
 
   if and only if $M$ is a double stochastic matrix.
 \end{theorem} 
 

-This former generator as successively passed various batteries of statistical tests, as the NIST tests~\cite{bcgr11:ip}.
+This former generator as successively passed various batteries of statistical tests, as the NIST~\cite{bcgr11:ip}, DieHARD~\cite{Marsaglia1996}, and TestU01~\cite{LEcuyerS07}.

 
 \subsection{Improving the Speed of the Former Generator}
 
 
 \subsection{Improving the Speed of the Former Generator}