1 @article{journals/combinatorics/BhatS96,
2 added-at = {2004-10-05T00:00:00.000+0200},
3 author = {Bhat, Girish S. and Savage, Carla D.},
4 biburl = {http://www.bibsonomy.org/bibtex/283f038cfa461052a4ea9836f4cc0bc80/dblp},
7 ee = {http://www.combinatorics.org/Volume_3/Abstracts/v3i1r25.html},
8 interhash = {fae414e8b2b088f7d85e5a34854a8b4c},
9 intrahash = {83f038cfa461052a4ea9836f4cc0bc80},
10 journal = {Electr. J. Comb.},
13 timestamp = {2004-10-05T00:00:00.000+0200},
14 title = {Balanced Gray Codes.},
15 url = {http://dblp.uni-trier.de/db/journals/combinatorics/combinatorics3.html#BhatS96},
19 @article{journals/combinatorics/FlahiveB07,
20 added-at = {2008-05-26T00:00:00.000+0200},
21 author = {Flahive, Mary and Bose, Bella},
22 biburl = {http://www.bibsonomy.org/bibtex/2d65e6641907754800ab867eef451c47b/dblp},
25 ee = {http://www.combinatorics.org/Volume_14/Abstracts/v14i1r31.html},
26 interhash = {4f4b52ab4827109c410cdb225a2f56f2},
27 intrahash = {d65e6641907754800ab867eef451c47b},
28 journal = {Electr. J. Comb.},
31 timestamp = {2008-05-26T00:00:00.000+0200},
32 title = {Balancing Cyclic R-ary Gray Codes.},
33 url = {http://dblp.uni-trier.de/db/journals/combinatorics/combinatorics14.html#FlahiveB07},
40 author={Zanten, A.~J.~van and Suparta, I.~N.},
41 title={ Totally balanced and exponentially balanced Gray codes},
42 journal={Discrete Analysis and Operational Research},
53 author = {Laurent Saloff-Coste},
54 title = {Random Walks on Finite Groups},
55 journal = {Probability on Descrete Structures},
62 note = {http://stat.stanford.edu/~cgates/PERSI/papers/rwfg.pdf},
68 title = {An Introduction to Chaotic Dynamical Systems},
69 publisher = {Addison-Wesley},
71 author = {Devaney, Robert L.},
72 address = {Redwood City, CA},
78 author = {J. Banks and J. Brooks and G. Cairns and P. Stacey},
79 title = {On {D}evaney's Definition of Chaos},
80 journal = {Amer. Math. Monthly},
86 timestamp = {27/01/2008}
90 @INPROCEEDINGS{wbg10:ip,
91 author = {Wang, Qianxue and Bahi, Jacques and Guyeux, Christophe and Fang,
93 title = {Randomness quality of {CI} chaotic generators. Application to Internet
95 booktitle = {INTERNET'2010. The 2nd Int. Conf. on Evolving Internet},
98 address = {Valencia, Spain},
100 publisher = {IEEE Computer Society Press},
101 note = {Best Paper award},
103 doi = {10.1109/INTERNET.2010.30},
104 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
107 url = {http://doi.ieeecomputersociety.org/10.1109/INTERNET.2010.30}
112 @INPROCEEDINGS{bgw10:ip,
113 author = {Bahi, Jacques and Guyeux, Christophe and Wang, Qianxue},
114 title = {A Pseudo Random Numbers Generator Based on Chaotic Iterations. Application
116 booktitle = {WISM 2010, Int. Conf. on Web Information Systems and Mining},
121 address = {Sanya, China},
124 doi = {10.1007/978-3-642-16515-3_26},
125 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
128 url = {http://dx.doi.org/10.1007/978-3-642-16515-3_26}
133 @INPROCEEDINGS{bgw09:ip,
134 author = {Bahi, Jacques and Guyeux, Christophe and Wang, Qianxue},
135 title = {A novel pseudo-random generator based on discrete chaotic iterations},
136 booktitle = {INTERNET'09, 1-st Int. Conf. on Evolving Internet},
139 address = {Cannes, France},
142 doi = {10.1109/INTERNET.2009.18},
143 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
146 url = {http://dx.doi.org/10.1109/INTERNET.2009.18}
151 @INPROCEEDINGS{guyeuxTaiwan10,
152 author = {Bahi, Jacques M. and Guyeux, Christophe and Wang, Qianxue},
153 title = {Improving random number generators by chaotic iterations. {A}pplication
155 booktitle = {ICCASM 2010, Int. Conf. on Computer Application and System Modeling},
157 pages = {V13-643--V13-647},
158 address = {Taiyuan, China},
161 doi = {10.1109/ICCASM.2010.5622199},
162 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
165 url = {http://dx.doi.org/10.1109/ICCASM.2010.5622199}
168 @inproceedings{bcgw11:ip,
170 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
173 author = {Bahi, Jacques and Couchot, Jean-Fran\c{c}ois and Guyeux, Christophe and Wang, Qianxue},
174 title = {Class of Trustworthy Pseudo Random Number Generators},
175 booktitle = {INTERNET 2011, the 3-rd Int. Conf. on Evolving Internet},
177 address = {Luxembourg, Luxembourg},
183 @INPROCEEDINGS{bcgr11:ip,
184 author = {Bahi, Jacques and Couchot, Jean-Fran\c{c}ois and Guyeux, Christophe
185 and Richard, Adrien},
186 title = {On the Link Between Strongly Connected Iteration Graphs and Chaotic
187 Boolean Discrete-Time Dynamical Systems},
188 booktitle = {FCT'11, 18th Int. Symp. on Fundamentals of Computation Theory},
193 address = {Oslo, Norway},
196 doi = {10.1007/978-3-642-22953-4_11},
197 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
200 url = {http://dx.doi.org/10.1007/978-3-642-22953-4_11}
205 @INPROCEEDINGS{bg10a:ip,
206 author = {Bahi, Jacques and Guyeux, Christophe},
207 title = {Topological chaos and chaotic iterations, application to Hash functions},
208 booktitle = {IJCNN'10, Int. Joint Conf. on Neural Networks, joint to WCCI'10,
209 IEEE World Congress on Computational Intelligence},
212 address = {Barcelona, Spain},
214 note = {Best paper award},
216 doi = {10.1109/IJCNN.2010.5596512},
217 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
220 url = {http://dx.doi.org/10.1109/IJCNN.2010.5596512}
224 @ARTICLE{DBLP:journals/corr/abs-1112-5239,
225 author = {Jacques M. Bahi and Rapha{\"e}l Couturier and Christophe Guyeux and
226 Pierre-Cyrille H{\'e}am},
227 title = {Efficient and Cryptographically Secure Generation of Chaotic Pseudorandom
231 volume = {abs/1112.5239},
232 bibsource = {DBLP, http://dblp.uni-trier.de},
233 ee = {http://arxiv.org/abs/1112.5239}
237 author = {E. Barker and A. Roginsky},
238 title = {DRAFT {N}{I}{S}{T} Special Publication 800-131 Recommendation for
239 the Transitioning of Cryptographic Algorithms and Key Sizes},
241 owner = {christophe},
242 timestamp = {2010.08.18}
247 author = {Pierre L'Ecuyer and Richard J. Simard},
248 title = {Test{U01}: {A} {C} library for empirical testing of random number
250 journal = {ACM Trans. Math. Softw},
254 bibdate = {2007-11-06},
255 bibsource = {DBLP, http://dblp.uni-trier.de/db/journals/toms/toms33.html#LEcuyerS07},
256 url = {http://doi.acm.org/10.1145/1268776.1268777}
260 @ARTICLE{Marsaglia1996,
261 author = {G. Marsaglia},
262 title = {DIE{HARD}: a battery of tests of randomness},
263 journal = {http://stat.fsu.edu/~geo/diehard.html},
266 timestamp = {2009.11.09}
270 author = {Xiaole Fang},
271 title = {Utilization of chaotic dynamics for generating pseudorandom numbers
272 in various contexts},
273 school = {Universit\'{e} de Franche-Comt\'{e}},
276 timestamp = {2008.01.02}
280 title = {Discrete Iterations, a Metric Study},
281 publisher = {Springer-Verlag},
283 author = {François Robert},
285 series = {Series in Computational Mathematics}
290 author={Stojanovski, T. and Pihl, J. and Kocarev, L.},
291 journal={Circuits and Systems I: Fundamental Theory and Applications, IEEE Transactions on},
292 title={Chaos-based random number generators. Part II: practical realization},
298 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},
299 doi={10.1109/81.915396},
303 @book{LevinPeresWilmer2006,
304 added-at = {2010-01-19T17:51:27.000+0100},
305 author = {Levin, David A. and Peres, Yuval and Wilmer, Elizabeth L.},
306 biburl = {http://www.bibsonomy.org/bibtex/2097dc4d1d0e412b2444f540b04110797/tmalsburg},
307 interhash = {61354795a6accb6407bfdbf04753a683},
308 intrahash = {097dc4d1d0e412b2444f540b04110797},
309 keywords = {markovchains probabilitytheory textbook},
310 publisher = {American Mathematical Society},
311 timestamp = {2010-01-19T17:51:27.000+0100},
312 title = {{Markov chains and mixing times}},
313 url = {http://scholar.google.com/scholar.bib?q=info:3wf9IU94tyMJ:scholar.google.com/&output=citation&hl=en&as_sdt=2000&ct=citation&cd=0},
319 author={Stojanovski, T. and Kocarev, L.},
320 journal={Circuits and Systems I: Fundamental Theory and Applications, IEEE Transactions on},
321 title={Chaos-based random number generators-part I: analysis [cryptography]},
327 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},
328 doi={10.1109/81.915385},
332 @ARTICLE{Simard07testu01:a,
333 author = {Richard Simard and Université De Montréal},
334 title = {TestU01: A C library for empirical testing of random number generators},
335 journal = {ACM Transactions on Mathematical Software},
341 @INPROCEEDINGS{5376454,
342 author={Li Cao and Lequan Min and Hongyan Zang},
343 booktitle={Computational Intelligence and Security, 2009. CIS '09. International Conference on},
344 title={A Chaos-Based Pseudorandom Number Generator and Performance Analysis},
349 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},
350 doi={10.1109/CIS.2009.203},}
354 domainehal = {INFO:INFO_DC, INFO:INFO_CR, INFO:INFO_MO},
357 impact-factor ={1.065},
358 isi-acro = {J NETW COMPUT APPL},
359 author = {Bahi, Jacques and Fang, Xiaole and Guyeux, Christophe and Wang, Qianxue},
360 title = {Suitability of chaotic iterations schemes using {XORshift} for security applications},
361 journal = {JNCA, Journal of Network and Computer Applications},
364 doi = {10.1016/j.jnca.2013.03.001},
365 url = {http://dx.doi.org/10.1016/j.jnca.2013.03.001},
366 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.},
367 publisher = {Elsevier},
373 title = {A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications},
375 author = {Rukhin, Andrew and Soto, Juan and Nechvatal, James and
376 Smid, Miles and Barker, Elaine and Leigh, Stefan and Levenson, Mark and
377 Vangel,Mark and Banks,David and Heckert,Alan and Dray,James and Vo, San},
378 organization = {National Institute of Standards and Technology},
381 note = {available at \url{http://csrc.nist.gov/groups/ST/toolkit/rng/documents/SP800-22rev1a.pdf}}
384 @incollection{BCGR11,
386 isbn={978-3-642-22952-7},
387 booktitle={Fundamentals of Computation Theory},
389 series={Lecture Notes in Computer Science},
390 editor={Owe, Olaf and Steffen, Martin and Telle, JanArne},
391 doi={10.1007/978-3-642-22953-4_11},
392 title={On the Link between Strongly Connected Iteration Graphs and Chaotic Boolean Discrete-Time Dynamical Systems},
393 url={http://dx.doi.org/10.1007/978-3-642-22953-4_11},
394 publisher={Springer Berlin Heidelberg},
395 keywords={Boolean network; discrete-time dynamical system; topological chaos},
396 author={Bahi, JacquesM. and Couchot, Jean-Francois and Guyeux, Christophe and Richard, Adrien},
402 @article{Feder:2009:NTB:1496397.1496515,
403 author = {Feder, Tom\'{a}s and Subi, Carlos},
404 title = {Nearly Tight Bounds on the Number of Hamiltonian Circuits of the Hypercube and Generalizations},
405 journal = {Inf. Process. Lett.},
406 issue_date = {February, 2009},
414 url = {http://dx.doi.org/10.1016/j.ipl.2008.10.015},
415 doi = {10.1016/j.ipl.2008.10.015},
417 publisher = {Elsevier North-Holland, Inc.},
418 address = {Amsterdam, The Netherlands, The Netherlands},
419 keywords = {Cartesian products, Counting problems, Hamiltonian circuits, Hypercube, Matchings},