Merkle puzzles
E102538
cryptographic protocol
key establishment scheme
key exchange protocol
public-key cryptography scheme
Merkle puzzles are an early cryptographic protocol that introduced the concept of public-key exchange by allowing two parties to establish a shared secret over an insecure channel using computationally asymmetric “puzzle” problems.
All labels observed (3)
| Label | Occurrences |
|---|---|
| Merkle puzzles canonical | 3 |
| Bob obtains a secret key from the solved puzzle | 1 |
| Merkle’s puzzles | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T853360 — 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.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Merkle puzzles Context triple: [Ralph Merkle, notableWork, Merkle puzzles]
-
A.
Secrecy, Authentication, and Public Key Systems
"Secrecy, Authentication, and Public Key Systems" is Ralph Merkle's influential doctoral thesis that helped lay the foundations of modern public-key cryptography and secure communication protocols.
-
B.
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.
-
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.
Probabilistic Encryption
Probabilistic Encryption is a cryptographic technique that uses randomness in the encryption process so that the same message encrypts to different ciphertexts, enhancing security against attackers.
-
E.
Merkle–Damgård construction
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.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Merkle puzzles Target entity description: Merkle puzzles are an early cryptographic protocol that introduced the concept of public-key exchange by allowing two parties to establish a shared secret over an insecure channel using computationally asymmetric “puzzle” problems.
-
A.
Secrecy, Authentication, and Public Key Systems
"Secrecy, Authentication, and Public Key Systems" is Ralph Merkle's influential doctoral thesis that helped lay the foundations of modern public-key cryptography and secure communication protocols.
-
B.
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.
-
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.
Probabilistic Encryption
Probabilistic Encryption is a cryptographic technique that uses randomness in the encryption process so that the same message encrypts to different ciphertexts, enhancing security against attackers.
-
E.
Merkle–Damgård construction
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.
- F. None of above. chosen
Statements (49)
| Predicate | Object |
|---|---|
| instanceOf |
cryptographic protocol
ⓘ
key establishment scheme ⓘ key exchange protocol ⓘ public-key cryptography scheme ⓘ |
| basedOn | puzzle problems ⓘ |
| category |
foundational cryptographic constructions
ⓘ
key-agreement protocols ⓘ |
| describedIn |
Secure Communications Over Insecure Channels
ⓘ
linked to:
New Directions in Cryptography
|
| field | cryptography ⓘ |
| hasGoal | establish a shared secret over an insecure channel ⓘ |
| hasProperty |
adversary requires quadratic work to break
ⓘ
computationally secure under bounded adversary ⓘ honest parties perform linear work ⓘ information-theoretically insecure ⓘ provides only limited security level ⓘ security grows quadratically with adversary work ⓘ |
| hasStep |
Alice and Bob share the secret key from that puzzle
ⓘ
Alice generates many encrypted puzzles ⓘ Alice identifies which puzzle Bob solved ⓘ Alice sends all puzzles to Bob over insecure channel ⓘ Bob obtains a secret key from the solved puzzle ⓘ
linked to:
Merkle puzzles
Bob randomly selects and solves one puzzle ⓘ Bob uses the secret key to authenticate himself to Alice ⓘ |
| historicalSignificance |
introduced idea of public discussion to establish a secret
ⓘ
one of the earliest public-key style protocols ⓘ |
| inspired |
Diffie–Hellman key exchange
ⓘ
Merkle’s later work on public-key systems ⓘ development of public-key cryptography ⓘ |
| introducedBy | Ralph Merkle ⓘ |
| involvesParty |
Alice
ⓘ
Bob ⓘ eavesdropper ⓘ |
| limitation |
high communication overhead
ⓘ
not practical for high security levels ⓘ requires large number of puzzles ⓘ vulnerable to adversaries with very high computational power ⓘ |
| proposedBy | Ralph Merkle ⓘ |
| publishedIn | Communications of the ACM ⓘ |
| relatedTo |
Diffie–Hellman key exchange
ⓘ
public-key cryptography ⓘ symmetric-key cryptography ⓘ |
| securityModel | adversary limited by computational resources ⓘ |
| threatModel | passive eavesdropping adversary ⓘ |
| usesConcept |
computational asymmetry
ⓘ
one-way functions ⓘ public discussion over insecure channel ⓘ symmetric-key encryption ⓘ |
| yearProposed | 1974 ⓘ |
| yearPublished | 1978 ⓘ |
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.
Instruction
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.
Input
Subject: Merkle puzzles Description of subject: Merkle puzzles are an early cryptographic protocol that introduced the concept of public-key exchange by allowing two parties to establish a shared secret over an insecure channel using computationally asymmetric “puzzle” problems.
Referenced by (5)
Full triples — surface form annotated when it differs from this entity's canonical label.
linked to: Merkle puzzles