Carter–Wegman MACs
E224031
Carter–Wegman MACs are a family of message authentication codes that use universal hashing combined with a secret key to provide efficient and provably secure authentication.
All labels observed (3)
| Label | Occurrences |
|---|---|
| Carter–Wegman MACs canonical | 1 |
| Naor–Stockmeyer notion of universal one-way hash functions | 1 |
| paper "Universal classes of hash functions" | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T2002249 — 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: Carter–Wegman MACs Context triple: [Poly1305, belongsToFamily, Carter–Wegman MACs]
-
A.
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.
-
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.
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.
-
D.
Merkle puzzles
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.
-
E.
Modern Cryptography, Probabilistic Proofs and Pseudorandomness
"Modern Cryptography, Probabilistic Proofs and Pseudorandomness" is a foundational textbook that systematically develops the theoretical underpinnings of modern cryptography, focusing on probabilistic proof techniques and the theory of pseudorandomness.
- 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: Carter–Wegman MACs Target entity description: Carter–Wegman MACs are a family of message authentication codes that use universal hashing combined with a secret key to provide efficient and provably secure authentication.
-
A.
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.
-
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.
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.
-
D.
Merkle puzzles
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.
-
E.
Modern Cryptography, Probabilistic Proofs and Pseudorandomness
"Modern Cryptography, Probabilistic Proofs and Pseudorandomness" is a foundational textbook that systematically develops the theoretical underpinnings of modern cryptography, focusing on probabilistic proof techniques and the theory of pseudorandomness.
- F. None of above. chosen
Statements (49)
| Predicate | Object |
|---|---|
| instanceOf |
cryptographic primitive
ⓘ
message authentication code ⓘ universal-hash-based MAC ⓘ |
| basedOn | universal hashing ⓘ |
| canBeCombinedWith | encryption schemes ⓘ |
| category | symmetric-key cryptography ⓘ |
| contrastWith |
HMAC
ⓘ
block-cipher-based MACs ⓘ |
| definedIn |
Carter–Wegman MACs
self-linksurface differs
ⓘ
surface form:
paper "Universal classes of hash functions"
|
| designedFor |
high-throughput applications
ⓘ
low-latency authentication ⓘ |
| forgeryProbability | bounded by 1 over size of hash range ⓘ |
| goal | efficient authentication with minimal assumptions ⓘ |
| hasAdvantage |
parallelizable computation
ⓘ
provable bounds on forgery probability ⓘ suitability for long messages ⓘ |
| hasProperty |
computational efficiency
ⓘ
fast hardware implementation ⓘ fast software implementation ⓘ information-theoretic security under certain assumptions ⓘ low computational overhead ⓘ provable security ⓘ |
| influenced |
NH-based MAC constructions
ⓘ
UMAC ⓘ VMAC ⓘ |
| introducedBy |
J. Lawrence Carter
ⓘ
Mark N. Wegman ⓘ |
| introducedIn | 1979 ⓘ |
| oftenImplementedWith |
polynomial hashing over finite fields
ⓘ
tabulation hashing variants ⓘ |
| operatesBy |
combining hash output with secret key material
ⓘ
hashing message with universal hash function ⓘ |
| provides |
authenticity
ⓘ
integrity protection ⓘ message authentication ⓘ |
| relatedConcept |
almost-universal hash family
ⓘ
universal hash family ⓘ ε-almost-universal hashing ⓘ |
| requires |
careful key management
ⓘ
unique nonces or one-time keys in some variants ⓘ |
| securityDependsOn |
choice of universal hash family
ⓘ
freshness of one-time pad or finalization key when used ⓘ secrecy of key ⓘ |
| securityModel | adversary with bounded number of forgery attempts ⓘ |
| typicalConstruction | hash-then-encrypt-tag with one-time pad or stream cipher ⓘ |
| usedIn |
high-speed cryptographic systems
ⓘ
network protocols ⓘ storage authentication ⓘ |
| uses | secret key ⓘ |
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: Carter–Wegman MACs Description of subject: Carter–Wegman MACs are a family of message authentication codes that use universal hashing combined with a secret key to provide efficient and provably secure authentication.
Referenced by (3)
Full triples — surface form annotated when it differs from this entity's canonical label.
this entity surface form:
paper "Universal classes of hash functions"
this entity surface form:
Naor–Stockmeyer notion of universal one-way hash functions