Randomness Quality of CI Chaotic Generators: Applications to Internet Security

Due to the rapid development of the Internet in recent years, the need to find new tools to reinforce trust and security through the Internet has became a major concern. The discovery of new pseudo-random number generators with a strong level of security is thus becoming a hot topic, because numerous cryptosystems and data hiding schemes are directly dependent on the quality of these generators. At the conference Internet`09, we have described a generator based on chaotic iterations, which behaves chaotically as defined by Devaney. In this paper, the proposal is to improve the speed and the security of this generator, to make its use more relevant in the Internet security context. To do so, a comparative study between various generators is carried out and 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.

[1]  David Thomas,et al.  The Art in Computer Programming , 2001 .

[2]  Xiao-jian Tian,et al.  Pseudo-random sequence generator based on the generalized Henon map , 2008 .

[3]  W. Marsden.  I and J , 2012 .

[4]  Jacques M. Bahi,et al.  Topological chaos and chaotic iterations application to hash functions , 2010, The 2010 International Joint Conference on Neural Networks (IJCNN).

[5]  M. Bernhard.  Introduction to Chaotic Dynamical Systems , 1992 .

[6]  Christophe Guyeux,et al.  A new chaos-based watermarking algorithm , 2010, 2010 International Conference on Security and Cryptography (SECRYPT).

[7]  Alfred Menezes,et al.  Handbook of Applied Cryptography , 2018 .

[8]  Jason Wittenberg,et al.  Clarify: Software for Interpreting and Presenting Statistical Results , 2003 .

[9]  Coskun Bayrak,et al.  A new hybrid nonlinear congruential number generator based on higher functional power of logistic maps , 2009 .

[10]  L. Kocarev.  Chaos-based cryptography: a brief overview , 2001 .

[11]  Donald E. Knuth,et al.  The art of computer programming. Vol.2: Seminumerical algorithms , 1981 .

[12]  François Robert,et al.  Discrete iterations - a metric study , 1986, Springer series in computational mathematics.

[13]  Elaine B. Barker,et al.  A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications , 2000 .

[14]  Pierre L'Ecuyer,et al.  Comparison of Point Sets and Sequences for Quasi-Monte Carlo and for Random Number Generation , 2008, SETA.

[15]  Angelo Vulpiani,et al.  Properties making a chaotic system a good pseudo random number generator. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.