A Simple Variant of the Merkle-Damg°ard Scheme with a Permutation

概要

論文の詳細を見る
We propose a new composition scheme for hash functions.It is a variant of the Merkle-Damg°ard construction with a permutationapplied right before the processing of the last message block. We analyzethe security of this scheme using the indifferentiability formalism,which was first adopted by Coron et al. to the analysis of hash functions.And we study the security of simple MAC constructions out ofthis scheme. Finally, we also discuss the random oracle indifferentiabilityof this scheme with a double-block-length compression function or theDavies-Meyer compression function composed of a block cipher.