[Resource Topic] 2009/274: A Collision-resistance Hash Function DIHA2

Welcome to the resource topic for 2009/274

Title:
A Collision-resistance Hash Function DIHA2

Authors: Xigen. Yao

Abstract:

Abstract. The new hash function DIHA2 (Dynamic Input Hash Algorithm)is with the structure of Merkle-Damgard and is based on 64-bit computing.It oper- ates each 1024-bit block and outputts a 256-bit hash-value. For a 64-bit sub-block X[j](0 ≤ j ≤ 15) of each step, DIHA2 gets a dynamic mapping value of TLU (table look up,The table was 256-Byte only)and add it to operation of variables a, b, c, d,so as to eliminate the differential effect.At the same time DIHA2 sets 3 assistant register variables r1, r2, r3 to store the mapping value and resume loading 3 steps later, so as to be interleaving. DIHA2 therefore obtained strong avalanche effect than the others and can resist the sharp and serious attack of differential.

ePrint: https://eprint.iacr.org/2009/274

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .