Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

22 relations
Avalanche effectCRAM-MD5Collision attackCollision resistance

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2020
2020
Enhancing Blockchain Performance Using Parallel Merkle Root and Parallel Proof of Work
2016
2016
Oblivious RAM: from theory to practice
Privacy of data storage has long been a central problem in computer security, having direct implications for many Internet-era… 
2014
2014
Cryptography and Information Security in the Balkans
Communication technologies have revolutionized modern society. They have changed the way we do business, travel, manage our… 
2013
2013
Faster Hash-Based Signatures with Bounded Leakage
Digital signatures have become a key component of many embedded system solutions and are facing strong security and efficiency… 
2011
2011
Epitome-based image compression using translational sub-pel mapping
This paper addresses the problem of epitome construction for image compression. An optimized epitome construction method is first… 
2010
2010
A fast hash tree generator for Merkle signature scheme
The Merkle Signature Scheme relies on hash function and is, therefore, assumed to be resistant to attacks by quantum computers… 
2009
2009
How to Prove the Security of Practical Cryptosystems with Merkle-Damgård Hashing by Adopting Indifferentiability
In this paper, we show that major cryptosystems such as FDH, OAEP, and RSA-KEM are secure under a hash function MD with Merkle… 
Review
2007
Review
2007
Mobile Web Survey: Möglichkeiten der Verknüpfung von Online-Befragung und Handy-Befragung
Der vorliegende Beitrag beschäftigt sich mit einer derzeit noch wenig genutzten Datenerhebungsmethode für standardisierte… 
2006
2006
Multi-block Collisions in Hash Functions Based on 3C and 3C+ Enhancements of the Merkle-Damgård Construction
At the ACISP 2006 conference Praveen Gauravaram et al [2] proposed 3C and 3C+ constructions as enhancements of the Merkle-Damgard… 
2000
2000
Genetic Algorithms for Reformulation of Large-Scale KDD Problems with Many Irrelevant Attributes
The goal of this research is to apply genetic implementations of algorithms for selection, partitioning, and synthesis of… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)