Merkle–Damgård construction

Known as: MD transform, Wide pipe design, Merkle-Damgard hash function 
In cryptography, the Merkle–Damgård construction or Merkle–Damgård hash function is a method of building collision-resistant cryptographic hash… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2017
Review
2017
Cryptographic hash function is an important cryptographic tool in the field of information security. Design of most widely used… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2012
2012
Cryptographic hash functions provide a basic data authentication mechanism and are used pervasively as building blocks to realize… (More)
  • figure 2
  • figure 3
  • figure 5
  • figure 4
  • figure 6
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Many cryptographic applications of hash functions are analyzed in the random oracle model. Unfortunately, most concrete hash… (More)
  • figure 2
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2009
2009
In this paper, we show that major cryptosystems such as FDH, OAEP, and RSA-KEM are secure under a hash function MD with Merkle… (More)
  • table 1
Is this relevant?
2007
2007
This paper presents a novel mode of operation of compression functions, intended for dedicated use as a message authentication… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • table 2
Is this relevant?
2006
2006
The paper discusses the security of compression function and hash function with Merkle-Damg̊ard construction and provides the… (More)
Is this relevant?
2006
2006
Recently multi-block collision attacks (MBCA) were performed on the Merkle-Damg̊ard (MD)-structure based hash functions MD5, SHA… (More)
  • figure 1
  • table 1
  • table 2
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2005
Highly Cited
2005
The most common way of constructing a hash function (e.g., SHA-1) is to iterate a compression function on the input message. The… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2001
Highly Cited
2001
The Cooperative File System (CFS) is a new peer-to-peer read-only storage system that provides provable guarantees for the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
2001
2001
In this paper we study two possible approaches to improving existing schemes for constructing hash functions that hash arbitrary… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?