A Topological Study of Chaotic Iterations Application to Hash Functions

Chaotic iterations, a tool formerly used in distributed computing, has recently revealed various interesting properties of disorder leading to its use in the computer science security field. In this paper, a comprehensive study of its topological behavior is proposed. It is stated that, in addition to being chaotic as defined in the Devaney’s formulation, this tool possesses the property of topological mixing. Additionally, its level of sensibility, expansivity, and topological entropy are evaluated. All of these properties lead to a complete unpredictable behavior for the chaotic iterations. As it only manipulates binary digits or integers, we show that it is possible to use it to produce truly chaotic computer programs. As an application example, a truly chaotic hash function is proposed in two versions. In the second version, an artificial neural network is used, which can be stated as chaotic according to Devaney.

[1]  Oleg G. Rudenko,et al.  Image compression based on the neural network art , 2008 .

[2]  Di Xiao,et al.  A novel Hash algorithm construction based on chaotic neural network , 2011, Neural Computing and Applications.

[3]  Jacques M. Bahi,et al.  Building a Chaotic Proved Neural Network , 2011, ArXiv.

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

[5]  Yan Jiang,et al.  A Wavelet Packets Watermarking Algorithm Based on Chaos Encryption , 2006, ICCSA.

[6]  Long Min,et al.  One-way Hash function construction based on two-dimensional hyper-chaotic mappings , 2005 .

[7]  Christophe Guyeux,et al.  Le désordre des itérations chaotiques et leur utilité en sécurité informatique. (The disorder of chaotic iterations and its use in the computer science security field) , 2010 .

[8]  Yong Wang,et al.  Improving the security of a parallel keyed hash function based on chaotic maps , 2009 .

[9]  Jacques M. Bahi,et al.  Randomness Quality of CI Chaotic Generators: Applications to Internet Security , 2010, 2010 2nd International Conference on Evolving Internet.

[10]  R. Devaney An Introduction to Chaotic Dynamical Systems , 1990 .

[11]  Zhi-Hong Guan,et al.  A novel digital watermark algorithm based on chaotic maps , 2007 .

[12]  Jacques M. Bahi,et al.  Chaotic Iterations versus Spread-Spectrum: Chaos and Stego Security , 2010, 2010 Sixth International Conference on Intelligent Information Hiding and Multimedia Signal Processing.

[13]  W. Xiaomin,et al.  One way Hash function construction based on the extended chaotic maps switch , 2003 .

[14]  R. Bowen Entropy for group endomorphisms and homogeneous spaces , 1971 .

[15]  Roy L. Adler,et al.  Topological entropy , 2008, Scholarpedia.

[16]  Jacques M. Bahi,et al.  Ramdomness quality of CI chaotic generators . Application to Internet security , 2010 .

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

[18]  Long Min,et al.  A Secure Digital Signature Algorithm Based on Elliptic Curve and Chaotic Mappings , 2005 .

[19]  Erol Gelenbe,et al.  Video compression with random neural networks , 1996, Proceedings of International Workshop on Neural Networks for Identification, Control, Robotics and Signal/Image Processing.

[20]  Liu Zhihua,et al.  Chaos-based multipurpose image watermarking algorithm , 2006, Wuhan University Journal of Natural Sciences.

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

[22]  Chang-song Zhou,et al.  Extracting information masked by chaos and contaminated with noise: Some considerations on the security of communication approaches using chaos , 1997 .

[23]  Jacques M. Bahi,et al.  A Novel Pseudo-random Number Generator Based on Discrete Chaotic Iterations , 2009, 2009 First International Conference on Evolving Internet.

[24]  Matthew V. Mahoney,et al.  Fast Text Compression with Neural Networks , 2000, FLAIRS Conference.

[25]  J. Banks,et al.  On Devaney's definition of chaos , 1992 .