Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2015
Highly Cited
2015
When Satoshi Nakamoto first set the Bitcoin blockchain into motion in January 2009, he was simultaneously introducing two… Expand
Is this relevant?
Highly Cited
2014
Highly Cited
2014
The InterPlanetary File System (IPFS) is a peer-to-peer distributed file system that seeks to connect all computing devices with… Expand
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2013
Highly Cited
2013
We initiate the study of quantum-secure digital signatures and quantum chosen ciphertext security. In the case of signatures, we… Expand
Is this relevant?
Highly Cited
2013
Highly Cited
2013
Order-preserving encryption - an encryption scheme where the sort order of ciphertexts matches the sort order of the… Expand
  • figure 1
  • figure 2
  • figure 5
  • figure 7
  • figure 9
Is this relevant?
Highly Cited
2007
Highly Cited
2007
We propose a new composition scheme for hash functions. It is a variant of the Merkle-Damgard construction with a permutation… Expand
Is this relevant?
2006
2006
Recently multi-block collision attacks (MBCA) were found on the Merkle-Damgard (MD)-structure based hash functions MD5, SHA-0 and… Expand
  • table 1
  • figure 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… Expand
  • 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… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
Highly Cited
1999
Highly Cited
1999
We give explicit constructions of extractors which work for a source of any min-entropy on strings of length n. These extractors… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1982
Highly Cited
1982
  • A. Shamir
  • 23rd Annual Symposium on Foundations of Computer…
  • 1982
  • Corpus ID: 206735498
The cryptographic security of the Merkle-Hellman cryptosystem has been a major open problem since 1976. In this paper we show… Expand
  • figure 1
  • figure 3
  • figure 2
Is this relevant?