avant soummission

[16dcc.git] / biblio.bib

diff --git a/biblio.bib b/biblio.bib
index 8e60a5489798919a421dcd9fc5a29c4bfdfd9de8..5e9f408cc8bbd24c8fc5278a8ae5afeb299d3312 100644 (file)
--- a/biblio.bib
+++ b/biblio.bib
@@ -145,6 +145,20 @@
   OPTannote =   {}
 }
 
   OPTannote =   {}
 }
 

+@inproceedings{bfgw11:ip,
+inhal = {no},
+domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
+equipe = {and},
+classement = {ACTI},
+author = {Bahi, Jacques and Fang, Xiaole and Guyeux, Christophe and Wang, Qianxue},
+title = {On the design of a family of {CI} pseudo-random number generators},
+booktitle = {WICOM'11, 7th Int. IEEE Conf. on Wireless Communications, Networking and Mobile Computing},
+pages = {1--4},
+address = {Wuhan, China},
+month = sep,
+year = 2011,
+
+}

 @Article{Rob78,
   author =      {F.~Robert},
   title =       {Th\'{e}or\`{e}me de Perron-Frobenius et Stein-Rosenberg booléens},
 @Article{Rob78,
   author =      {F.~Robert},
   title =       {Th\'{e}or\`{e}me de Perron-Frobenius et Stein-Rosenberg booléens},


@@ -488,7 +502,6 @@
   bibsource =  "DBLP,
                 http://dblp.uni-trier.de/db/journals/cacm/cacm4.html#Kuehn61",
   pages =      "350--352",
   bibsource =  "DBLP,
                 http://dblp.uni-trier.de/db/journals/cacm/cacm4.html#Kuehn61",
   pages =      "350--352",

-  URL =        "http://doi.acm.org/10.1145/366678.366690",

 }
 
 @TechReport{ICSI-TR-90-039,
 }
 
 @TechReport{ICSI-TR-90-039,


@@ -534,7 +547,6 @@
   bibsource =  "DBLP,
                 http://dblp.uni-trier.de/db/journals/mcma/mcma10.html#Sugita04",
   pages =      "609--615",
   bibsource =  "DBLP,
                 http://dblp.uni-trier.de/db/journals/mcma/mcma10.html#Sugita04",
   pages =      "609--615",

-  URL =        "http://dx.doi.org/10.1515/mcma.2004.10.3-4.609",

 }
 
 @Article{Marsaglia98,
 }
 
 @Article{Marsaglia98,


@@ -636,11 +648,9 @@ year = 2014,
   publisher = {IEEE Computer Society Press},
   note = {Best Paper award},
   classement = {ACTI},
   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},
   domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
   equipe = {and},
   inhal = {no},

-  url = {http://doi.ieeecomputersociety.org/10.1109/INTERNET.2010.30}

 }
 
 
 }
 
 


@@ -657,11 +667,9 @@ year = 2014,
   address = {Sanya, China},
   month = oct,
   classement = {ACTI},
   address = {Sanya, China},
   month = oct,
   classement = {ACTI},

-  doi = {10.1007/978-3-642-16515-3_26},

   domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
   equipe = {and},
   inhal = {no},
   domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
   equipe = {and},
   inhal = {no},

-  url = {http://dx.doi.org/10.1007/978-3-642-16515-3_26}

 }
 
 
 }
 
 


@@ -675,11 +683,9 @@ year = 2014,
   address = {Cannes, France},
   month = aug,
   classement = {ACTI},
   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},
   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{guyeuxTaiwan10,
 }
 
 @INPROCEEDINGS{guyeuxTaiwan10,


@@ -691,7 +697,6 @@ month={Oct},
 volume={13},
 pages={V13-643-V13-647},
 keywords={cryptography;data encapsulation;random number generation;DieHARD statistical test suite;XORshifts PRNG;chaotic iterations;cryptographic applications;data hiding;pseudo-random number generator;Authentication;Cryptography;DNA;Generators;Discrete chaotic iterations;Internet security;Pseudo-random number generator;Statistical tests;Topological chaos;data hiding},
 volume={13},
 pages={V13-643-V13-647},
 keywords={cryptography;data encapsulation;random number generation;DieHARD statistical test suite;XORshifts PRNG;chaotic iterations;cryptographic applications;data hiding;pseudo-random number generator;Authentication;Cryptography;DNA;Generators;Discrete chaotic iterations;Internet security;Pseudo-random number generator;Statistical tests;Topological chaos;data hiding},

-doi={10.1109/ICCASM.2010.5622199},

 publisher={IEEE}
 }
 
 publisher={IEEE}
 }
 


@@ -720,11 +725,9 @@ year = 2011}
   month = jul,
   note = {Best paper award},
   classement = {ACTI},
   month = jul,
   note = {Best paper award},
   classement = {ACTI},

-  doi = {10.1109/IJCNN.2010.5596512},

   domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
   equipe = {and},
   inhal = {no},
   domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
   equipe = {and},
   inhal = {no},

-  url = {http://dx.doi.org/10.1109/IJCNN.2010.5596512}

 }
 
 
 }
 
 


@@ -760,7 +763,6 @@ year = 2011}
   number = {4},
   bibdate = {2007-11-06},
   bibsource = {DBLP, http://dblp.uni-trier.de/db/journals/toms/toms33.html#LEcuyerS07},
   number = {4},
   bibdate = {2007-11-06},
   bibsource = {DBLP, http://dblp.uni-trier.de/db/journals/toms/toms33.html#LEcuyerS07},

-  url = {http://doi.acm.org/10.1145/1268776.1268777}

 }
 
 
 }
 
 


@@ -803,7 +805,6 @@ volume={48},
 number={3}, 
 pages={382-385}, 
 keywords={CMOS analogue integrated circuits;chaos generators;circuit simulation;piecewise linear techniques;random number generation;redundancy;switched current circuits;0.8 micron;1 Mbit/s;chaos-based random number generators;chaotic piecewise-linear one-dimensional map;output bit rate;parasitic attractors;periodic attractors;post-layout circuit simulations;process conditions;redundancy;standard CMOS process;switched current techniques;Bit rate;CMOS process;Chaos;Circuits;Electric breakdown;Information analysis;Piecewise linear techniques;Power supplies;Random number generation;Temperature}, 
 number={3}, 
 pages={382-385}, 
 keywords={CMOS analogue integrated circuits;chaos generators;circuit simulation;piecewise linear techniques;random number generation;redundancy;switched current circuits;0.8 micron;1 Mbit/s;chaos-based random number generators;chaotic piecewise-linear one-dimensional map;output bit rate;parasitic attractors;periodic attractors;post-layout circuit simulations;process conditions;redundancy;standard CMOS process;switched current techniques;Bit rate;CMOS process;Chaos;Circuits;Electric breakdown;Information analysis;Piecewise linear techniques;Power supplies;Random number generation;Temperature}, 

-doi={10.1109/81.915396}, 

 ISSN={1057-7122},}
 
 
 ISSN={1057-7122},}
 
 


@@ -817,7 +818,6 @@ volume={48},
 number={3}, 
 pages={281-288}, 
 keywords={Markov processes;chaos;cryptography;piecewise linear techniques;random number generation;Markov generating partition;Markov information source;chaos-based random number generators;cryptography;information generation process;parameter values;piecewise-linear one-dimensional map;random number generator;Chaos;Cryptographic protocols;Cryptography;Current measurement;Low-frequency noise;Noise measurement;Random number generation;Random sequences;Security;Semiconductor device noise}, 
 number={3}, 
 pages={281-288}, 
 keywords={Markov processes;chaos;cryptography;piecewise linear techniques;random number generation;Markov generating partition;Markov information source;chaos-based random number generators;cryptography;information generation process;parameter values;piecewise-linear one-dimensional map;random number generator;Chaos;Cryptographic protocols;Cryptography;Current measurement;Low-frequency noise;Noise measurement;Random number generation;Random sequences;Security;Semiconductor device noise}, 

-doi={10.1109/81.915385}, 

 ISSN={1057-7122},}
 
 @INPROCEEDINGS{5376454,
 ISSN={1057-7122},}
 
 @INPROCEEDINGS{5376454,


@@ -829,7 +829,6 @@ month={Dec},
 volume={1},
 pages={494-498},
 keywords={binary sequences;chaos;discrete systems;random number generation;synchronisation;2D Arnold cat map;6D discrete chaos map;FIPA-140-2 tests;National Institute of Standard and Technology;binary number sequences;chaos-based pseudorandom number generator;confidence interval analysis;generalized chaos synchronization theorem;performance analysis;Chaos;Chaotic communication;Computational intelligence;NIST;Nonlinear dynamical systems;Performance analysis;Random number generation;Security;Space technology;Testing;Discrete chaos map;generalized chaos synchronization;one-time-pad;statistical test},
 volume={1},
 pages={494-498},
 keywords={binary sequences;chaos;discrete systems;random number generation;synchronisation;2D Arnold cat map;6D discrete chaos map;FIPA-140-2 tests;National Institute of Standard and Technology;binary number sequences;chaos-based pseudorandom number generator;confidence interval analysis;generalized chaos synchronization theorem;performance analysis;Chaos;Chaotic communication;Computational intelligence;NIST;Nonlinear dynamical systems;Performance analysis;Random number generation;Security;Space technology;Testing;Discrete chaos map;generalized chaos synchronization;one-time-pad;statistical test},

-doi={10.1109/CIS.2009.203},

 publisher={IEEE}
 }
 
 publisher={IEEE}
 }
 


@@ -845,8 +844,6 @@ title = {Suitability of chaotic iterations schemes using {XORshift} for security
 journal = {JNCA, Journal of Network and Computer Applications},
 pages = {282--292},
 volume = 37,
 journal = {JNCA, Journal of Network and Computer Applications},
 pages = {282--292},
 volume = 37,

-doi = {10.1016/j.jnca.2013.03.001},
-url = {http://dx.doi.org/10.1016/j.jnca.2013.03.001},

 abstract = {The design and engineering of original cryptographic solutions is a major concern to provide secure information systems. In a previous study, we have described a generator based on chaotic iterations, which uses the well-known XORshift generator. By doing so, we have improved the statistical performances of XORshift and make it behave chaotically, as defined by Devaney. The speed and security of this former generator have been improved in a second study, to make its usage more relevant in the Internet security context. In this paper, these contributions are summarized and a new version of the generator is introduced. It is based on a new Lookup Table implying a large improvement of speed. A comparison and a security analysis between the XORshift and these three versions of our generator are proposed, and various new statistical results are given. Finally, an application in the information hiding framework is presented, to give an illustrative example of the use of such a generator in the Internet security field.},
 publisher = {Elsevier},
 year = 2013,
 abstract = {The design and engineering of original cryptographic solutions is a major concern to provide secure information systems. In a previous study, we have described a generator based on chaotic iterations, which uses the well-known XORshift generator. By doing so, we have improved the statistical performances of XORshift and make it behave chaotically, as defined by Devaney. The speed and security of this former generator have been improved in a second study, to make its usage more relevant in the Internet security context. In this paper, these contributions are summarized and a new version of the generator is introduced. It is based on a new Lookup Table implying a large improvement of speed. A comparison and a security analysis between the XORshift and these three versions of our generator are proposed, and various new statistical results are given. Finally, an application in the information hiding framework is presented, to give an illustrative example of the use of such a generator in the Internet security field.},
 publisher = {Elsevier},
 year = 2013,


@@ -899,7 +896,6 @@ year = 2013,
   number =     "5",
   volume =     "109",
   pages =      "267--272",
   number =     "5",
   volume =     "109",
   pages =      "267--272",

-  URL =        "http://dx.doi.org/10.1016/j.ipl.2008.10.015",

 }
 
 @inproceedings{DBLP:conf/secrypt/CouchotHGWB14,
 }
 
 @inproceedings{DBLP:conf/secrypt/CouchotHGWB14,


@@ -947,11 +943,9 @@ year = 2013,
   publisher = {IEEE Computer Society Press},
   note = {Best Paper award},
   classement = {ACTI},
   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},
   domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
   equipe = {and},
   inhal = {no},

-  url = {http://doi.ieeecomputersociety.org/10.1109/INTERNET.2010.30}

 }
 
 
 }
 
 


@@ -969,11 +963,9 @@ year = 2013,
   address = {Cannes, France},
   month = aug,
   classement = {ACTI},
   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},
   domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
   equipe = {and},
   inhal = {no},

-  url = {http://dx.doi.org/10.1109/INTERNET.2009.18}

 }
 
 
 }
 
 


@@ -992,11 +984,9 @@ year = 2013,
   address = {Oslo, Norway},
   month = aug,
   classement = {ACTI},
   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},
   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}

 }
 
 
 }
 
 


@@ -1041,8 +1031,6 @@ number="1",
 pages="78--85",
 abstract="We consider locally balanced Gray codes.We say that a Gray code is locally balanced if every ``short'' subword in its transition sequence contains all letters of the alphabet |1, 2,..., n{\textasciitilde}. The minimal length of these subwords is the window width of the code. We show that for each n ≥ 3 there exists a Gray code with window width at most n + 3⌊log n⌋.",
 issn="1990-4797",
 pages="78--85",
 abstract="We consider locally balanced Gray codes.We say that a Gray code is locally balanced if every ``short'' subword in its transition sequence contains all letters of the alphabet |1, 2,..., n{\textasciitilde}. The minimal length of these subwords is the window width of the code. We show that for each n ≥ 3 there exists a Gray code with window width at most n + 3⌊log n⌋.",
 issn="1990-4797",

-doi="10.1134/S1990478916010099",
-url="http://dx.doi.org/10.1134/S1990478916010099"

 }
 
 
 }