TDHA-A One-Way Hash Algorithm Based on Extended Integer Tent Maps with Dynamic Properties

This paper proposes a one-way hashing algorithm called TDHA. TDHA compresses a message of arbitrary length into a fingerprint of 160 bits. The compression function in-use was constructed based on the analysis of uniform distribution property of Extended Integer Tent Maps. This algorithm takes the Extended Integer Tent Maps as major nonlinear component of compression function, propagates strong dynamic differential diffusion, turns the constant words used in the traditional Hash function into dynamic parameter words. Parallel iteration structure is adopted in the compression functions. In addition, the MD structure is improved so that the capacity of collision resistance of the middle iteration process of the Hash function is enhanced without extending intermediate states. Preliminary security testing indicates that, this Hash function has a high degree of security, and it can be realized easily with great rapidity. Therefore, it is an ideal substitution for conventional Hash function.