Merkle–Damgård construction
E99142
The Merkle–Damgård construction is a fundamental method for building collision-resistant cryptographic hash functions from fixed-size compression functions, used in many classic hash algorithms like MD5 and SHA-1.
All labels observed (5)
| Label | Occurrences |
|---|---|
| Merkle–Damgård construction canonical | 4 |
| MD5 | 1 |
| Merkle–Damgård | 1 |
| Merkle–Damgård hash construction | 1 |
| Merkle–Damgård strengthening | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T853342 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
Target entity: Merkle–Damgård construction Context triple: [Ralph Merkle, knownFor, Merkle–Damgård construction]
-
A.
HMAC
HMAC (Hash-based Message Authentication Code) is a cryptographic construction that combines a secret key with a hash function to provide data integrity and authentication.
-
B.
Poly1305
Poly1305 is a high-speed message authentication code (MAC) algorithm commonly used with stream ciphers like ChaCha20 to provide data integrity and authenticity.
-
C.
Diffie–Hellman key exchange
Diffie–Hellman key exchange is a foundational cryptographic protocol that enables two parties to securely establish a shared secret over an insecure communication channel.
-
D.
New Directions in Cryptography
New Directions in Cryptography is a landmark 1976 paper that introduced the concepts of public-key cryptography and digital signatures, fundamentally reshaping modern cryptography and secure communications.
-
E.
Salsa20
Salsa20 is a high-speed stream cipher designed by Daniel J. Bernstein, widely used in modern cryptography for its strong security and efficient software performance.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Target entity: Merkle–Damgård construction Target entity description: The Merkle–Damgård construction is a fundamental method for building collision-resistant cryptographic hash functions from fixed-size compression functions, used in many classic hash algorithms like MD5 and SHA-1.
-
A.
HMAC
HMAC (Hash-based Message Authentication Code) is a cryptographic construction that combines a secret key with a hash function to provide data integrity and authentication.
-
B.
Poly1305
Poly1305 is a high-speed message authentication code (MAC) algorithm commonly used with stream ciphers like ChaCha20 to provide data integrity and authenticity.
-
C.
Diffie–Hellman key exchange
Diffie–Hellman key exchange is a foundational cryptographic protocol that enables two parties to securely establish a shared secret over an insecure communication channel.
-
D.
New Directions in Cryptography
New Directions in Cryptography is a landmark 1976 paper that introduced the concepts of public-key cryptography and digital signatures, fundamentally reshaping modern cryptography and secure communications.
-
E.
Salsa20
Salsa20 is a high-speed stream cipher designed by Daniel J. Bernstein, widely used in modern cryptography for its strong security and efficient software performance.
- F. None of above. chosen
Statements (46)
| Predicate | Object |
|---|---|
| instanceOf |
cryptographic construction
ⓘ
hash function design paradigm ⓘ |
| appliesTo | arbitrary-length messages ⓘ |
| assumes | compression function is collision-resistant ⓘ |
| basedOn | fixed-length compression function ⓘ |
| computes | chaining value for each message block ⓘ |
| contrastWith |
HAIFA construction
ⓘ
sponge construction ⓘ wide-pipe construction ⓘ |
| domain |
information security
ⓘ
theoretical computer science ⓘ |
| field |
cryptographic hash functions
ⓘ
cryptography ⓘ |
| finalStep | output last chaining value as hash ⓘ |
| formalizedIn |
Damgård 1989 paper
ⓘ
Merkle 1989 paper ⓘ |
| goal | provable security reduction from hash to compression function ⓘ |
| hasPart |
compression function
ⓘ
initialization vector ⓘ iterative chaining process ⓘ padding scheme ⓘ |
| implies | hash function is collision-resistant if compression function is collision-resistant ⓘ |
| independentlyProposedBy |
Ivan Damgård
ⓘ
Ralph Merkle ⓘ |
| influenced | design of many classic hash standards ⓘ |
| inspired | later domain-extension constructions for hash functions ⓘ |
| limitation | does not inherently provide indifferentiability from a random oracle ⓘ |
| Merkle–Damgård strengthening | padding that appends message length ⓘ |
| namedAfter |
Eli Biham
ⓘ
surface form:
Ivan Damgård
Ralph Merkle ⓘ |
| output | fixed-length hash value ⓘ |
| property | length extension property ⓘ |
| requires |
collision-resistant padding
ⓘ
publicly known initialization vector ⓘ |
| securityModel | black-box model of compression function ⓘ |
| typicalPadding |
Merkle–Damgård construction
self-linksurface differs
ⓘ
surface form:
Merkle–Damgård strengthening
|
| use | building collision-resistant hash functions ⓘ |
| usedIn |
HAVAL
ⓘ
MD5 ⓘ RIPEMD-160 ⓘ SHA-0 ⓘ SHA-1 ⓘ SHA-2 ⓘ |
| usesInput | message blocks of fixed size ⓘ |
| vulnerableTo | length extension attacks ⓘ |
| yearProposed | late 1970s ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Subject: Merkle–Damgård construction Description of subject: The Merkle–Damgård construction is a fundamental method for building collision-resistant cryptographic hash functions from fixed-size compression functions, used in many classic hash algorithms like MD5 and SHA-1.
Referenced by (8)
Full triples — surface form annotated when it differs from this entity's canonical label.