-\newcommand{\etalchar}[1]{$^{#1}$}
-\begin{thebibliography}{CHG{\etalchar{+}}14b}
-
-\bibitem[BBCS92]{Banks92}
-J.~Banks, J.~Brooks, G.~Cairns, and P.~Stacey.
-\newblock On {D}evaney's definition of chaos.
-\newblock {\em Amer. Math. Monthly}, 99:332--334, 1992.
-
-\bibitem[BCGR11]{bcgr11:ip}
-Jacques Bahi, Jean-Fran\c{c}ois Couchot, Christophe Guyeux, and Adrien Richard.
-\newblock On the link between strongly connected iteration graphs and chaotic
- boolean discrete-time dynamical systems.
-\newblock In {\em FCT'11, 18th Int. Symp. on Fundamentals of Computation
- Theory}, volume 6914 of {\em LNCS}, pages 126--137, Oslo, Norway, August
- 2011.
-
-\bibitem[BR10]{Nist10}
-E.~Barker and A.~Roginsky.
-\newblock Draft {N}{I}{S}{T} special publication 800-131 recommendation for the
- transitioning of cryptographic algorithms and key sizes, 2010.
-
-\bibitem[CHG{\etalchar{+}}14a]{chgw14oip}
-Jean-Fran\c{c}ois Couchot, Pierre-Cyrille H\'eam, Christophe Guyeux, Qianxue
- Wang, and Jacques Bahi.
-\newblock Pseudorandom number generators with balanced gray codes.
-\newblock In {\em Secrypt 2014, 11th Int. Conf. on Security and Cryptography},
- pages 469--475, Vienna, Austria, August 2014.
-\newblock Position short paper.
-
-\bibitem[CHG{\etalchar{+}}14b]{DBLP:conf/secrypt/CouchotHGWB14}
-Jean{-}Fran{\c{c}}ois Couchot, Pierre{-}Cyrille H{\'{e}}am, Christophe Guyeux,
- Qianxue Wang, and Jacques~M. Bahi.
-\newblock Pseudorandom number generators with balanced gray codes.
-\newblock In Mohammad~S. Obaidat, Andreas Holzinger, and Pierangela Samarati,
- editors, {\em {SECRYPT} 2014 - Proceedings of the 11th International
- Conference on Security and Cryptography, Vienna, Austria, 28-30 August,
- 2014}, pages 469--475. SciTePress, 2014.
-
-\bibitem[CMZ09]{5376454}
-Li~Cao, Lequan Min, and Hongyan Zang.
-\newblock A chaos-based pseudorandom number generator and performance analysis.
-\newblock In {\em Computational Intelligence and Security, 2009. CIS '09.
- International Conference on}, volume~1, pages 494--498. IEEE, Dec 2009.
-
-\bibitem[Dev89]{Devaney}
-Robert~L. Devaney.
-\newblock {\em An Introduction to Chaotic Dynamical Systems}.
-\newblock Addison-Wesley, Redwood City, CA, 2nd edition, 1989.
-
-\bibitem[GWB10]{guyeuxTaiwan10}
-Christophe Guyeux, Qianxue Wang, and J.M. Bahi.
-\newblock Improving random number generators by chaotic iterations application
- in data hiding.
-\newblock In {\em Computer Application and System Modeling (ICCASM), 2010
- International Conference on}, volume~13, pages V13--643--V13--647. IEEE, Oct
- 2010.
-
-\bibitem[LPW06]{LevinPeresWilmer2006}
-David~A. Levin, Yuval Peres, and Elizabeth~L. Wilmer.
-\newblock {\em {Markov chains and mixing times}}.
-\newblock American Mathematical Society, 2006.
-
-\bibitem[LS07]{LEcuyerS07}
-Pierre L'Ecuyer and Richard~J. Simard.
-\newblock Test{U01}: {A} {C} library for empirical testing of random number
- generators.
-\newblock {\em ACM Trans. Math. Softw}, 33(4), 2007.
-
-\bibitem[Mar96]{Marsaglia1996}
-G.~Marsaglia.
-\newblock Diehard: a battery of tests of randomness.
-\newblock {\em http://stat.fsu.edu/~geo/diehard.html}, 1996.
-
-\bibitem[MU05]{proba}
-M.~Mitzenmacher and Eli Upfal.
-\newblock {\em Probability and Computing}.
-\newblock Cambridge University Press, 2005.
-
-\bibitem[SK01]{915385}
-T.~Stojanovski and L.~Kocarev.
-\newblock Chaos-based random number generators-part i: analysis [cryptography].
-\newblock {\em Circuits and Systems I: Fundamental Theory and Applications,
- IEEE Transactions on}, 48(3):281--288, Mar 2001.
-
-\bibitem[SPK01]{915396}
-T.~Stojanovski, J.~Pihl, and L.~Kocarev.
-\newblock Chaos-based random number generators. part ii: practical realization.
-\newblock {\em Circuits and Systems I: Fundamental Theory and Applications,
- IEEE Transactions on}, 48(3):382--385, Mar 2001.
-
-\bibitem[WBGF10]{wbg10ip}
-Qianxue Wang, Jacques Bahi, Christophe Guyeux, and Xiaole Fang.
-\newblock Randomness quality of {CI} chaotic generators. application to
- internet security.
-\newblock In {\em INTERNET'2010. The 2nd Int. Conf. on Evolving Internet},
- pages 125--130, Valencia, Spain, September 2010. IEEE Computer Society Press.
-\newblock Best Paper award.
+% Generated by IEEEtran.bst, version: 1.14 (2015/08/26)
+\begin{thebibliography}{10}
+\providecommand{\url}[1]{#1}
+\csname url@samestyle\endcsname
+\providecommand{\newblock}{\relax}
+\providecommand{\bibinfo}[2]{#2}
+\providecommand{\BIBentrySTDinterwordspacing}{\spaceskip=0pt\relax}
+\providecommand{\BIBentryALTinterwordstretchfactor}{4}
+\providecommand{\BIBentryALTinterwordspacing}{\spaceskip=\fontdimen2\font plus
+\BIBentryALTinterwordstretchfactor\fontdimen3\font minus
+ \fontdimen4\font\relax}
+\providecommand{\BIBforeignlanguage}[2]{{%
+\expandafter\ifx\csname l@#1\endcsname\relax
+\typeout{** WARNING: IEEEtran.bst: No hyphenation pattern has been}%
+\typeout{** loaded for the language `#1'. Using the pattern for}%
+\typeout{** the default language instead.}%
+\else
+\language=\csname l@#1\endcsname
+\fi
+#2}}
+\providecommand{\BIBdecl}{\relax}
+\BIBdecl
+
+\bibitem{915396}
+T.~Stojanovski, J.~Pihl, and L.~Kocarev, ``Chaos-based random number
+ generators. part ii: practical realization,'' \emph{Circuits and Systems I:
+ Fundamental Theory and Applications, IEEE Transactions on}, vol.~48, no.~3,
+ pp. 382--385, Mar 2001.
+
+\bibitem{915385}
+T.~Stojanovski and L.~Kocarev, ``Chaos-based random number generators-part i:
+ analysis [cryptography],'' \emph{Circuits and Systems I: Fundamental Theory
+ and Applications, IEEE Transactions on}, vol.~48, no.~3, pp. 281--288, Mar
+ 2001.
+
+\bibitem{5376454}
+L.~Cao, L.~Min, and H.~Zang, ``A chaos-based pseudorandom number generator and
+ performance analysis,'' in \emph{Computational Intelligence and Security,
+ 2009. CIS '09. International Conference on}, vol.~1.\hskip 1em plus 0.5em
+ minus 0.4em\relax IEEE, Dec 2009, pp. 494--498.
+
+\bibitem{Marsaglia1996}
+G.~Marsaglia, ``Diehard: a battery of tests of randomness,''
+ \emph{http://stat.fsu.edu/~geo/diehard.html}, 1996.
+
+\bibitem{Nist10}
+E.~Barker and A.~Roginsky, ``Draft {N}{I}{S}{T} special publication 800-131
+ recommendation for the transitioning of cryptographic algorithms and key
+ sizes,'' 2010.
+
+\bibitem{LEcuyerS07}
+\BIBentryALTinterwordspacing
+P.~L'Ecuyer and R.~J. Simard, ``Test{U01}: {A} {C} library for empirical
+ testing of random number generators,'' \emph{ACM Trans. Math. Softw},
+ vol.~33, no.~4, 2007. [Online]. Available:
+ \url{http://doi.acm.org/10.1145/1268776.1268777}
+\BIBentrySTDinterwordspacing
+
+\bibitem{Devaney}
+R.~L. Devaney, \emph{An Introduction to Chaotic Dynamical Systems},
+ 2nd~ed.\hskip 1em plus 0.5em minus 0.4em\relax Redwood City, CA:
+ Addison-Wesley, 1989.
+
+\bibitem{guyeuxTaiwan10}
+C.~Guyeux, Q.~Wang, and J.~Bahi, ``Improving random number generators by
+ chaotic iterations application in data hiding,'' in \emph{Computer
+ Application and System Modeling (ICCASM), 2010 International Conference on},
+ vol.~13.\hskip 1em plus 0.5em minus 0.4em\relax IEEE, Oct 2010, pp.
+ V13--643--V13--647.
+
+\bibitem{bcgr11:ip}
+\BIBentryALTinterwordspacing
+J.~Bahi, J.-F. Couchot, C.~Guyeux, and A.~Richard, ``On the link between
+ strongly connected iteration graphs and chaotic boolean discrete-time
+ dynamical systems,'' in \emph{FCT'11, 18th Int. Symp. on Fundamentals of
+ Computation Theory}, ser. LNCS, vol. 6914, Oslo, Norway, Aug. 2011, pp.
+ 126--137. [Online]. Available:
+ \url{http://dx.doi.org/10.1007/978-3-642-22953-4_11}
+\BIBentrySTDinterwordspacing
+
+\bibitem{wbg10ip}
+\BIBentryALTinterwordspacing
+Q.~Wang, J.~Bahi, C.~Guyeux, and X.~Fang, ``Randomness quality of {CI} chaotic
+ generators. application to internet security,'' in \emph{INTERNET'2010. The
+ 2nd Int. Conf. on Evolving Internet}.\hskip 1em plus 0.5em minus 0.4em\relax
+ Valencia, Spain: IEEE Computer Society Press, Sep. 2010, pp. 125--130, best
+ Paper award. [Online]. Available:
+ \url{http://doi.ieeecomputersociety.org/10.1109/INTERNET.2010.30}
+\BIBentrySTDinterwordspacing
+
+\bibitem{DBLP:conf/secrypt/CouchotHGWB14}
+J.~Couchot, P.~H{\'{e}}am, C.~Guyeux, Q.~Wang, and J.~M. Bahi, ``Pseudorandom
+ number generators with balanced gray codes,'' in \emph{{SECRYPT} 2014 -
+ Proceedings of the 11th International Conference on Security and
+ Cryptography, Vienna, Austria, 28-30 August, 2014}, M.~S. Obaidat,
+ A.~Holzinger, and P.~Samarati, Eds.\hskip 1em plus 0.5em minus 0.4em\relax
+ SciTePress, 2014, pp. 469--475.
+
+\bibitem{Banks92}
+J.~Banks, J.~Brooks, G.~Cairns, and P.~Stacey, ``On {D}evaney's definition of
+ chaos,'' \emph{Amer. Math. Monthly}, vol.~99, pp. 332--334, 1992.
+
+\bibitem{Robinson:1981:CS}
+\BIBentryALTinterwordspacing
+J.~P. Robinson and M.~Cohn, ``Counting sequences,'' \emph{IEEE Trans. Comput.},
+ vol.~30, no.~1, pp. 17--23, Jan. 1981. [Online]. Available:
+ \url{http://dl.acm.org/citation.cfm?id=1963620.1963622}
+\BIBentrySTDinterwordspacing
+
+\bibitem{DBLP:journals/combinatorics/BhatS96}
+\BIBentryALTinterwordspacing
+G.~S. Bhat and C.~D. Savage, ``Balanced gray codes,'' \emph{Electr. J. Comb.},
+ vol.~3, no.~1, 1996. [Online]. Available:
+ \url{http://www.combinatorics.org/Volume_3/Abstracts/v3i1r25.html}
+\BIBentrySTDinterwordspacing
+
+\bibitem{ZanSup04}
+I.~Suparta and A.~v. Zanten, ``Totally balanced and exponentially balanced gray
+ codes,'' \emph{Discrete Analysis and Operation Research (Russia)}, vol.~11,
+ no.~4, pp. 81--98, 2004.
+
+\bibitem{Bykov2016}
+\BIBentryALTinterwordspacing
+I.~S. Bykov, ``On locally balanced gray codes,'' \emph{Journal of Applied and
+ Industrial Mathematics}, vol.~10, no.~1, pp. 78--85, 2016. [Online].
+ Available: \url{http://dx.doi.org/10.1134/S1990478916010099}
+\BIBentrySTDinterwordspacing
+
+\bibitem{LevinPeresWilmer2006}
+\BIBentryALTinterwordspacing
+D.~A. Levin, Y.~Peres, and E.~L. Wilmer, \emph{{Markov chains and mixing
+ times}}.\hskip 1em plus 0.5em minus 0.4em\relax American Mathematical
+ Society, 2006. [Online]. Available:
+ \url{http://scholar.google.com/scholar.bib?q=info:3wf9IU94tyMJ:scholar.google.com/&output=citation&hl=en&as_sdt=2000&ct=citation&cd=0}
+\BIBentrySTDinterwordspacing
+
+\bibitem{proba}
+M.~Mitzenmacher and E.~Upfal, \emph{Probability and Computing}.\hskip 1em plus
+ 0.5em minus 0.4em\relax Cambridge University Press, 2005.
