A simple variant of the Merkle-Damgård Scheme with a permutation

Shoichi Hirose, Je Hong Park, Aaram Yun

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

51 Scopus citations

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.

Original languageEnglish
Title of host publicationAdvances in Cryptology - ASIACRYPT 2007 - 13th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings
PublisherSpringer Verlag
Pages113-129
Number of pages17
ISBN (Print)9783540768999
DOIs
StatePublished - 2007
Event13th International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2007 - Kuching, Malaysia
Duration: 2 Dec 20076 Dec 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4833 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference13th International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2007
Country/TerritoryMalaysia
CityKuching
Period2/12/076/12/07

Fingerprint

Dive into the research topics of 'A simple variant of the Merkle-Damgård Scheme with a permutation'. Together they form a unique fingerprint.

Cite this