From: couchot Date: Wed, 8 Nov 2017 11:00:56 +0000 (+0100) Subject: ajout X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/bibliographie.git/commitdiff_plain/refs/heads/master?hp=ea55d3a65207fae190d76fb1bc4e6e6c5f380ce4 ajout --- diff --git a/bib/biblioand.bib b/bib/biblioand.bib index ead419b..7a15d9d 100644 --- a/bib/biblioand.bib +++ b/bib/biblioand.bib @@ -1,6 +1,69 @@ % This file was created with JabRef 2.3.1. % Encoding: ANSI_X3.4-1968 +@Article{Bykov2016, +author="Bykov, I. S.", +title="On locally balanced gray codes", +journal="Journal of Applied and Industrial Mathematics", +year="2016", +volume="10", +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", +} + + +@article{DBLP:journals/ijbc/Lozi12, + author = {R. Lozi}, + title = {Emergence of Randomness from Chaos}, + journal = {I. J. Bifurcation and Chaos}, + volume = {22}, + number = {2}, + year = {2012}, + url = {http://dx.doi.org/10.1142/S0218127412500216}, + doi = {10.1142/S0218127412500216}, + timestamp = {Tue, 27 Mar 2012 19:10:15 +0200}, + biburl = {http://dblp.uni-trier.de/rec/bib/journals/ijbc/Lozi12}, + bibsource = {dblp computer science bibliography, http://dblp.org} +} + +@article{lozi:hal-00813087, + TITLE = {{From Chaos to Randomness via Geometric Undersampling}}, + AUTHOR = {Lozi, Ren{\'e} and Taralova, Ina}, + URL = {https://hal.archives-ouvertes.fr/hal-00813087}, + NOTE = {Editors: Witold Jarczyk, Daniele Fournier-Prunaret, João Manuel Goncalves Cabral}, + JOURNAL = {{ESAIM: Proceedings and Surveys}}, + PUBLISHER = {{EDP Sciences}}, + SERIES = {ECIT 2012}, + VOLUME = {46}, + PAGES = {177-195}, + YEAR = {2014}, + MONTH = Nov, + DOI = {10.1051/proc/201446015}, + KEYWORDS = {chaos ; Pseudo Random Number generator ; geometric undersampling}, + PDF = {https://hal.archives-ouvertes.fr/hal-00813087/file/Lozi_Taralova_ECIT_2012_HAL.pdf}, + HAL_ID = {hal-00813087}, + HAL_VERSION = {v1}, +} + +@inproceedings{espinelrojas:hal-00622989, + TITLE = {{NEW ALTERNATE LOZI FUNCTION FOR RANDOM NUMBER GENERATION}}, + AUTHOR = {Espinel Rojas, Andrea and Taralova, Ina and Lozi, Ren{\'e}}, + URL = {https://hal.archives-ouvertes.fr/hal-00622989}, + BOOKTITLE = {{EPNACS 2011 within ECCS'11}}, + ADDRESS = {Vienne, Austria}, + PAGES = {13-15}, + YEAR = {2011}, + MONTH = Sep, + KEYWORDS = {Nonlinear dynamical system ; Lozi function ; NIST test ; discrete-time map ; dense chaotic attractor ; pseudo random number generator}, + PDF = {https://hal.archives-ouvertes.fr/hal-00622989/file/NEW_ALTERNATE_LOZI_FUNCTION_FOR_RANDOM_NUMBER_GENERATION.pdf}, + HAL_ID = {hal-00622989}, + HAL_VERSION = {v1}, +} + + + @inproceedings{mansingka2013fibonacci, title={Fibonacci-Based Hardware Post-Processing for Non-Autonomous Signum Hyperchaotic System}, author={Mansingka, Abhinav S and Barakat, Mohamed L and Zidan, M Affan and Radwan, Ahmed G and Salama, Khaled N}, @@ -82,6 +145,28 @@ doi={10.1109/DDECS.2014.6868789},} +@article{Fang:2014:FAP:2643744.2643848, + author = {Fang, Xiaole and Wang, Qianxue and Guyeux, Christophe and Bahi, Jacques M.}, + title = {FPGA Acceleration of a Pseudorandom Number Generator Based on Chaotic Iterations}, + journal = {J. Inf. Secur. Appl.}, + issue_date = {February, 2014}, + volume = {19}, + number = {1}, + month = feb, + year = {2014}, + issn = {2214-2126}, + pages = {78--87}, + numpages = {10}, + url = {http://dx.doi.org/10.1016/j.jisa.2014.02.003}, + doi = {10.1016/j.jisa.2014.02.003}, + acmid = {2643848}, + publisher = {Elsevier Science Inc.}, + address = {New York, NY, USA}, + keywords = {Cryptographical security, Discrete chaotic iterations, FPGA, Internet security, Pseudorandom number generator}, +} + + + @inproceedings{mao2006design, title={Design and FPGA implementation of a pseudo-random bit sequence generator using spatiotemporal chaos}, author={Mao, Yaobin and Cao, Liu and Liu, Wenbo}, @@ -2870,7 +2955,7 @@ keywords = "Fuzzy edge detector" @InProceedings{kcm16:ip, - author = {N. Khernane, J.-F. Couchot, A. Mostefaoui}, + author = {Khernane, N. and Couchot, J.-F. and Mostefaoui, A.}, title = {Maximizing Network Lifetime in Wireless Video Sensor Networks Under Quality Constraints}, OPTcrossref = {}, OPTkey = {}, @@ -3043,6 +3128,7 @@ keywords = "Image encryption" } + @article{Feder2009NTB, author = {Feder, Tom\'{a}s and Subi, Carlos}, title = {Nearly Tight Bounds on the Number of Hamiltonian Circuits of the Hypercube and Generalizations}, @@ -3146,9 +3232,9 @@ year = 2014, @inproceedings{DBLP:conf/secrypt/MohammedCG16, - author = {Bakiri Mohammed and - Jean{-}Fran{\c{c}}ois Couchot and - Christophe Guyeux}, + author = {Bakiri, Mohammed and + Couchot, Jean{-}Fran{\c{c}}ois and + Guyeux, Christophe }, title = {{FPGA} Implementation of F2-Linear Pseudorandom Number Generators based on Zynq MPSoC: {A} Chaotic Iterations Post Processing Case Study}, booktitle = {Proceedings of the 13th International Joint Conference on e-Business @@ -3184,17 +3270,26 @@ year = 2014, } @article{ccgh16, -author = {Couchot, Jean-Fran\c{c}ois and Contassot-Vivier, Sylvain and -H\'eam, Pierre-Cyrille and Guyeux, Christophe}, -title = {Random Walk in a N-cube Without Hamiltonian Cycle - to Chaotic Pseudorandom Number Generation: Theoretical and Practical - Considerations}, -journal = {International Journal of Bifurcation and Chaos}, -note={Accepted on Oct 2016}, -year = 2016 + author = {Sylvain Contassot{-}Vivier and + Jean{-}Fran{\c{c}}ois Couchot and + Christophe Guyeux and + Pierre{-}Cyrille H{\'{e}}am}, + title = {Random Walk in a N-Cube Without Hamiltonian Cycle to Chaotic Pseudorandom + Number Generation: Theoretical and Practical Considerations}, + journal = {I. J. Bifurcation and Chaos}, + volume = {27}, + number = {1}, + pages = {1--18}, + year = {2017}, + url = {https://doi.org/10.1142/S0218127417500146}, + doi = {10.1142/S0218127417500146}, + timestamp = {Fri, 26 May 2017 22:50:42 +0200}, + biburl = {http://dblp.uni-trier.de/rec/bib/journals/ijbc/Contassot-Vivier17}, + bibsource = {dblp computer science bibliography, http://dblp.org} } + @article{Khan2014251, title = "A recent survey of reversible watermarking techniques ", journal = "Information Sciences ", @@ -3215,3 +3310,93 @@ keywords = "Quantization", keywords = "Prediction error ", abstract = "Abstract The art of secretly hiding and communicating information has gained immense importance in the last two decades due to the advances in generation, storage, and communication technology of digital content. Watermarking is one of the promising solutions for tamper detection and protection of digital content. However, watermarking can cause damage to the sensitive information present in the cover work. Therefore, at the receiving end, the exact recovery of cover work may not be possible. Additionally, there exist certain applications that may not tolerate even small distortions in cover work prior to the downstream processing. In such applications, reversible watermarking instead of conventional watermarking is employed. Reversible watermarking of digital content allows full extraction of the watermark along with the complete restoration of the cover work. For the last few years, reversible watermarking techniques are gaining popularity because of its increasing applications in some important and sensitive areas, i.e., military communication, healthcare, and law-enforcement. Due to the rapid evolution of reversible watermarking techniques, a latest review of recent research in this field is highly desirable. In this survey, the performances of different reversible watermarking schemes are discussed on the basis of various characteristics of watermarking. However, the major focus of this survey is on prediction-error expansion based reversible watermarking techniques, whereby the secret information is hidden in the prediction domain through error expansion. Comparison of the different reversible watermarking techniques is provided in tabular form, and an analysis is carried out. Additionally, experimental comparison of some of the recent reversible watermarking techniques, both in terms of watermarking properties and computational time, is provided on a dataset of 300 images. Future directions are also provided for this potentially important field of watermarking. " } + + + + +@inproceedings{DBLP:conf/automata/Contassot-Vivier17, + author = {Sylvain Contassot{-}Vivier and + Jean{-}Fran{\c{c}}ois Couchot}, + title = {Canonical Form of Gray Codes in N-cubes}, + booktitle = {Cellular Automata and Discrete Complex Systems - 23rd {IFIP} {WG} + 1.5 International Workshop, {AUTOMATA} 2017, Milan, Italy, June 7-9, + 2017, Proceedings}, + pages = {68--80}, + year = {2017}, + crossref = {DBLP:conf/automata/2017}, + url = {https://doi.org/10.1007/978-3-319-58631-1_6}, + doi = {10.1007/978-3-319-58631-1_6}, + timestamp = {Wed, 24 May 2017 10:11:43 +0200}, + biburl = {http://dblp.uni-trier.de/rec/bib/conf/automata/Contassot-Vivier17}, + bibsource = {dblp computer science bibliography, http://dblp.org} +} + +@proceedings{DBLP:conf/automata/2017, + editor = {Alberto Dennunzio and + Enrico Formenti and + Luca Manzoni and + Antonio E. Porreca}, + title = {Cellular Automata and Discrete Complex Systems - 23rd {IFIP} {WG} + 1.5 International Workshop, {AUTOMATA} 2017, Milan, Italy, June 7-9, + 2017, Proceedings}, + series = {Lecture Notes in Computer Science}, + volume = {10248}, + publisher = {Springer}, + year = {2017}, + url = {https://doi.org/10.1007/978-3-319-58631-1}, + doi = {10.1007/978-3-319-58631-1}, + isbn = {978-3-319-58630-4}, + timestamp = {Wed, 24 May 2017 10:11:10 +0200}, + biburl = {http://dblp.uni-trier.de/rec/bib/conf/automata/2017}, + bibsource = {dblp computer science bibliography, http://dblp.org} +} + + + +@inproceedings{DBLP:conf/secrypt/BakiriCG17, + author = {Mohammed Bakiri and + Jean{-}Fran{\c{c}}ois Couchot and + Christophe Guyeux}, + title = {One Random Jump and One Permutation: Sufficient Conditions to Chaotic, + Statistically Faultless, and Large Throughput {PRNG} for {FPGA}}, + booktitle = {Proceedings of the 14th International Joint Conference on e-Business + and Telecommunications {(ICETE} 2017) - Volume 4: SECRYPT, Madrid, + Spain, July 24-26, 2017.}, + pages = {295--302}, + year = {2017}, + crossref = {DBLP:conf/secrypt/2017}, + url = {https://doi.org/10.5220/0006418502950302}, + doi = {10.5220/0006418502950302}, + timestamp = {Thu, 17 Aug 2017 18:36:09 +0200}, + biburl = {http://dblp.uni-trier.de/rec/bib/conf/secrypt/BakiriCG17}, + bibsource = {dblp computer science bibliography, http://dblp.org} +} + +@proceedings{DBLP:conf/secrypt/2017, + editor = {Pierangela Samarati and + Mohammad S. Obaidat and + Enrique Cabello}, + title = {Proceedings of the 14th International Joint Conference on e-Business + and Telecommunications {(ICETE} 2017) - Volume 4: SECRYPT, Madrid, + Spain, July 24-26, 2017}, + publisher = {SciTePress}, + year = {2017}, + isbn = {978-989-758-259-2}, + timestamp = {Thu, 17 Aug 2017 18:31:18 +0200}, + biburl = {http://dblp.uni-trier.de/rec/bib/conf/secrypt/2017}, + bibsource = {dblp computer science bibliography, http://dblp.org} +} + +@ARTICLE{BCG17IEEE, +author={M. Bakiri and J. F. Couchot and C. Guyeux}, +journal={IEEE Transactions on Circuits and Systems I: Regular Papers}, +title={CIPRNG: A VLSI Family of Chaotic Iterations Post-Processings for F2; Linear Pseudorandom Number Generation Based on Zynq MPSoC}, +year={2017}, +volume={PP}, +number={99}, +pages={1-14}, +keywords={FPGA.;Pseudorandom number generators;applied cryptography;discrete dynamical systems;hardware security;statistical tests;system on chip}, +doi={10.1109/TCSI.2017.2754650}, +ISSN={1549-8328}, +month={} +} \ No newline at end of file