A Double-Piped iterated hash function based on a hybrid of chaotic maps

A novel iterated hash function based on double-pipe structure and the combination of Chebyshev chaotic map and piecewise linear chaotic map (PWLCM) is described in this paper. This function encodes a message of arbitrary length into a hash value with a fixed 128-bit length. For the proposed function, we conduct the following performance analyses: one-way property analysis, statistic analysis of diffusion and confusion, attacks resistance analysis and key space analysis. The results indicate that the function has desirable security properties which make it a suitable choice for data integrity applications.