On the use of chaotic iterations to design keyed hash function

Due to the complex dynamical properties of chaos, designing chaos-based hash functions emerged as a new research direction to reinforce information security of data sent through the Internet. This paper aims at developing a novel methodology to construct keyed hash functions based on chaotic iterations, which can avoid dynamic degradation caused by finite precision. The chaotic iterations are used first in the design of strategies thanks to particular pseudorandom number generators. They are also used in hash value computation, by iterating on state-of-the-art hash functions. Security investigations related to sensitiveness, diffusion and confusion, and collision analysis validate the proposed systematic methodology, showing that such post-processing on standard hash functions will preserve their security properties.