Hash-based Message Authentication Code
E832816
Hash-based Message Authentication Code (HMAC) is a cryptographic mechanism that uses a hash function and a secret key to verify both the integrity and authenticity of a message.
All labels observed (2)
| Label | Occurrences |
|---|---|
| Hash-based Message Authentication Code canonical | 1 |
| Keyed-Hash Message Authentication Code | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T9931194 — 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: Hash-based Message Authentication Code Context triple: [RFC 2104, defines, Hash-based Message Authentication Code]
-
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.
Carter–Wegman MACs
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.
-
C.
Message-Digest Algorithm 5
Message-Digest Algorithm 5 (MD5) is a widely known but now cryptographically broken hash function that produces a 128-bit hash value and was once commonly used for checksums and data integrity verification.
-
D.
Secure Hash Standard
The Secure Hash Standard is a U.S. federal standard that specifies secure hash algorithms (such as the SHA family) used for generating fixed-size cryptographic hashes to ensure data integrity and support digital signatures.
-
E.
Whirlpool hash function
Whirlpool is a cryptographic hash function designed by Vincent Rijmen and Paulo S. L. M. Barreto, known for its wide-pipe construction and strong security properties suitable for digital signatures and data integrity.
- 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: Hash-based Message Authentication Code Target entity description: Hash-based Message Authentication Code (HMAC) is a cryptographic mechanism that uses a hash function and a secret key to verify both the integrity and authenticity of a message.
-
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.
Carter–Wegman MACs
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.
-
C.
Message-Digest Algorithm 5
Message-Digest Algorithm 5 (MD5) is a widely known but now cryptographically broken hash function that produces a 128-bit hash value and was once commonly used for checksums and data integrity verification.
-
D.
Secure Hash Standard
The Secure Hash Standard is a U.S. federal standard that specifies secure hash algorithms (such as the SHA family) used for generating fixed-size cryptographic hashes to ensure data integrity and support digital signatures.
-
E.
Whirlpool hash function
Whirlpool is a cryptographic hash function designed by Vincent Rijmen and Paulo S. L. M. Barreto, known for its wide-pipe construction and strong security properties suitable for digital signatures and data integrity.
- F. None of above. chosen
Statements (50)
| Predicate | Object |
|---|---|
| instanceOf |
cryptographic primitive
ⓘ
message authentication code ⓘ |
| abbreviation | HMAC ⓘ |
| alternativeTo |
CBC-MAC
NERFINISHED
ⓘ
CMAC NERFINISHED ⓘ |
| basedOn | iterated hash function construction ⓘ |
| belongsTo | symmetric cryptography ⓘ |
| canBeTruncatedTo | shorter tag length ⓘ |
| commonlyUses |
MD5
NERFINISHED
ⓘ
SHA-1 ⓘ SHA-256 NERFINISHED ⓘ SHA-512 NERFINISHED ⓘ |
| definedIn | RFC 2104 NERFINISHED ⓘ |
| formalSecurityModel | PRF-based security model ⓘ |
| hasProperty |
collision resistance inherited from hash function
ⓘ
computationally infeasible to forge without key ⓘ deterministic output for given key and message ⓘ keyed construction ⓘ |
| hasPurpose |
data origin authentication
ⓘ
message authentication ⓘ message integrity verification ⓘ |
| introducedBy |
Hugo Krawczyk
NERFINISHED
ⓘ
Mihir Bellare NERFINISHED ⓘ Ran Canetti NERFINISHED ⓘ |
| introducedInYear | 1996 ⓘ |
| isResistantTo | length extension attacks ⓘ |
| notProvides | non-repudiation ⓘ |
| outputDependsOn |
message
ⓘ
secret key ⓘ underlying hash function ⓘ |
| provides |
authentication
ⓘ
integrity protection ⓘ tamper detection ⓘ |
| recommendedKeyLengthAtLeast | 128 bits ⓘ |
| requires | shared secret key between sender and receiver ⓘ |
| securityReliesOn |
pseudorandomness of the underlying hash function
ⓘ
secrecy of the key ⓘ |
| standardizedBy |
Internet Engineering Task Force
ⓘ
surface form:
IETF
NIST NERFINISHED ⓘ |
| standardizedIn | FIPS 198-1 NERFINISHED ⓘ |
| tagLengthLimitedBy | output size of underlying hash function ⓘ |
| usedIn |
API authentication
ⓘ
IPsec NERFINISHED ⓘ JSON Web Tokens NERFINISHED ⓘ OAuth NERFINISHED ⓘ SSH NERFINISHED ⓘ TLS ⓘ digital signature schemes as building block ⓘ |
| uses |
cryptographic hash function
ⓘ
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: Hash-based Message Authentication Code Description of subject: Hash-based Message Authentication Code (HMAC) is a cryptographic mechanism that uses a hash function and a secret key to verify both the integrity and authenticity of a message.
Referenced by (2)
Full triples — surface form annotated when it differs from this entity's canonical label.