Abstract
We propose a new composition scheme for hash functions. It is a variant of the Merkle-Damgård construction with a permutation applied right before the processing of the last message block. We analyze the 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 of this scheme. Finally, we also discuss the random oracle indifferentiability of this scheme with a double-block-length compression function or the Davies-Meyer compression function composed of a block cipher. © International Association for Cryptology Research 2007.
Cite
CITATION STYLE
Hirose, S., Park, J. H., & Yun, A. (2007). A simple variant of the Merkle-Damgård Scheme with a permutation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4833 LNCS, pp. 113–129). Springer Verlag. https://doi.org/10.1007/978-3-540-76900-2_7
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
