Design, Analysis and Implementation of a New Hash Function Based on Block Cipher

Abstract

In this paper, a new 2m-bit iterated hash function based on a m-bit block cipher with a 2m-bit key is firstly presented. Different from previous 2mbit hash function based on block ciphers, the hash round function in our proposal utilizes a single underlying block cipher. Secondly, five attacks on the hash function are treated. The results show that its hash round function can completely resist target attack, collision attack and semi-free-start collision attack and the whole scheme can be expected to have ideal computational security against the five attacks when the underlying cipher is assumed to have no weakness. Finally, the implementation of the new hash function is discussed. For the underlying cipher to be easily implemented in both software and hardware, so is the new hash function because only two basic 64-bit algebraic operations are introduced in the hash round function on basis of the cipher.