Quality Analysis of a Chaotic Proven Keyed Hash Function

Hash functions are cryptographic tools, which are notably involved in integrity checking and password storage. They are of primary importance to improve the security of exchanges through the Internet. However, as security flaws have been recently identified in the current standard in this domain, new ways to hash digital data must be investigated. In this document an original keyed hash function is evaluated. It is based on asynchronous iterations leading to functions that have been proven to be chaotic. It thus possesses various topological properties as uniformity and sensibility to its initial condition. These properties make our hash function satisfies established security requirements in this field. This claim is qualitatively proven and experimentally verified in this research work, among other things by realizing a large number of simulations.

[1]  Claude E. Shannon,et al.  Communication theory of secrecy systems , 1949, Bell Syst. Tech. J..

[2]  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.

[3]  Josef Pieprzyk,et al.  Keyed Hash Functions , 1995, Cryptography: Policy and Algorithms.

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

[5]  Wei Guo,et al.  Cryptanalysis on a parallel keyed hash function based on chaotic maps , 2009 .

[6]  Jacques M. Bahi,et al.  Class of Trustworthy Pseudo-Random Number Generators , 2011, ArXiv.

[7]  John Kelsey,et al.  Status Report on the Second Round of the SHA-3 Cryptographic Hash Algorithm Competition , 2011 .

[8]  Don Coppersmith,et al.  Another Birthday Attack , 1986, CRYPTO.

[9]  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 .

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

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

[12]  Stafford E. Tavares,et al.  On the Design of S-Boxes , 1985, CRYPTO.

[13]  Carsten Knudsen,et al.  Chaos Without Nonperiodicity , 1994 .

[14]  Jacques M. Bahi,et al.  Steganography: A Class of Secure and Robust Algorithms , 2012, Comput. J..

[15]  Jacques M. Bahi,et al.  Performance Analysis of a Keyed Hash Function based on Discrete and Chaotic Proven Iterations , 2011, ArXiv.

[16]  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 .

[17]  Yong Wang,et al.  Parallel keyed hash function construction based on chaotic neural network , 2009, Neurocomputing.

[18]  Xiaofeng Liao,et al.  A chaos-based hash function with both modification detection and localization capabilities , 2010 .

[19]  Jacques M. Bahi,et al.  Efficient and cryptographically secure generation of chaotic pseudorandom numbers on GPU , 2015, The Journal of Supercomputing.

[20]  Jacques M. Bahi,et al.  Hash Functions Using Chaotic Iterations , 2017, ArXiv.