Construct and Analyze K-Hash Function Based on Chaotic Dynamic S-Boxes

By combining the traditional iteration structure of Hash function with the dynamic S-boxes, a novel keyed Hash function is presented. The proposed approach can give a chaotic Hash value by means of the lookup table of functions and chaotic dynamic S-box. Compared with the existing chaotic Hash functions, this method improves computational performance of Hash system by using the chaotic S-box substitution. Theoretical and experimental results show that the proposed method has not only strong one way property, sensitivity to initial conditions and chaotic system’s parameters, but also high speed.