A  Collision-resistance Hash Function DIHA2

Xigen. Yao

Paper 2009/274

A Collision-resistance Hash Function DIHA2

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.

Metadata

Available format(s): PDF
Publication info: Published elsewhere. Unknown where it was published
Keywords: hash function dynamic mapping avalanche differential
Contact author(s): dihuo377 @ 163 com
wai2ha @ qq com
History: 2009-06-09: received
Short URL: https://ia.cr/2009/274
License: CC BY

BibTeX

@misc{cryptoeprint:2009/274,
      author = {Xigen. Yao},
      title = {A  Collision-resistance Hash Function {DIHA2}},
      howpublished = {Cryptology {ePrint} Archive, Paper 2009/274},
      year = {2009},
      url = {https://eprint.iacr.org/2009/274}
}