On a Provable Secure Hash Algorithm Based on the Merkle-Damgard Structure

In this paper, we propose a provable secured hash function based on the block cipher, called BM, with 512-bits hash length. The proposed hash algorithm uses the Alpha-DBL compression function proposed by Linh et al. and the underlying block cipher which is constructed from Rijndael algorithm. Moreover, our proposed hash algorithm expected to achieve some provable security properties such as collision resistance, preimage resistance and second image resistance.