GHASH
E663911
GHASH is a polynomial-based universal hash function used within Galois/Counter Mode (GCM) to provide efficient message authentication over binary fields.
All labels observed (1)
| Label | Occurrences |
|---|---|
| GHASH canonical | 2 |
How this entity was disambiguated
This entity first appeared as the object of triple T7414988 — 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: GHASH Context triple: [Galois/Counter Mode, authenticationStructure, GHASH]
-
A.
Teku
Teku is an open-source Ethereum consensus client written in Java, designed to run Ethereum proof-of-stake validators in a secure and enterprise-friendly way.
-
B.
Merkle
Merkle is a surname most prominently associated with Ralph Merkle, a pioneering computer scientist and cryptographer known for his foundational work in public-key cryptography and Merkle trees.
-
C.
Chain Gate
Chain Gate is one of the historic entrances to Jerusalem’s Noble Sanctuary (Al-Aqsa compound), located along the western wall of the sacred precinct.
-
D.
SHA-256
SHA-256 is a widely used cryptographic hash function from the SHA-2 family that produces a 256-bit hash value for securing data integrity and authentication.
-
E.
Gasselte
Gasselte is a village in the Dutch province of Drenthe, known for its surrounding forests, heathlands, and recreational lakes.
- 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: GHASH Target entity description: GHASH is a polynomial-based universal hash function used within Galois/Counter Mode (GCM) to provide efficient message authentication over binary fields.
-
A.
Teku
Teku is an open-source Ethereum consensus client written in Java, designed to run Ethereum proof-of-stake validators in a secure and enterprise-friendly way.
-
B.
Merkle
Merkle is a surname most prominently associated with Ralph Merkle, a pioneering computer scientist and cryptographer known for his foundational work in public-key cryptography and Merkle trees.
-
C.
Chain Gate
Chain Gate is one of the historic entrances to Jerusalem’s Noble Sanctuary (Al-Aqsa compound), located along the western wall of the sacred precinct.
-
D.
SHA-256
SHA-256 is a widely used cryptographic hash function from the SHA-2 family that produces a 256-bit hash value for securing data integrity and authentication.
-
E.
Gasselte
Gasselte is a village in the Dutch province of Drenthe, known for its surrounding forests, heathlands, and recreational lakes.
- F. None of above. chosen
Statements (47)
| Predicate | Object |
|---|---|
| instanceOf |
message authentication primitive
ⓘ
polynomial hash function ⓘ universal hash function ⓘ |
| associatedWith | AES-GCM NERFINISHED ⓘ |
| basedOn | polynomial evaluation over GF(2^128) ⓘ |
| category | cryptographic hash function (non-general-purpose) ⓘ |
| collisionProbabilityBound | proportional to number of blocks squared divided by 2^128 ⓘ |
| combinationOperation | XOR of polynomial multiplication results ⓘ |
| combines | associated data and ciphertext into a single hash value ⓘ |
| designGoal |
high performance in hardware
ⓘ
high performance in software with carry-less multiplication instructions ⓘ |
| domain | symmetric-key cryptography ⓘ |
| efficiencyReason | uses binary field arithmetic amenable to parallelization ⓘ |
| fieldNotation | GF(2^128) ⓘ |
| fieldType | binary finite field ⓘ |
| hashFamilyType | ε-almost-∆-universal hash family ⓘ |
| implementationOptimization | CLMUL (carry-less multiply) CPU instruction support ⓘ |
| inputBlockSize | 128-bit blocks ⓘ |
| inputType |
blocks of associated data
ⓘ
ciphertext blocks ⓘ |
| keyType | hash subkey H ⓘ |
| mathematicalStructure | polynomial ring over GF(2) modulo an irreducible polynomial of degree 128 ⓘ |
| notDesignedFor | collision-resistant general-purpose hashing ⓘ |
| operationOrder | processes input blocks sequentially ⓘ |
| operationType | bitwise XOR and carry-less multiplication ⓘ |
| outputType | fixed-length authentication tag value ⓘ |
| purpose |
authentication tag computation
ⓘ
integrity protection ⓘ message authentication ⓘ |
| relatedConcept |
Carter–Wegman MAC
NERFINISHED
ⓘ
Wegman–Carter universal hashing NERFINISHED ⓘ |
| requires | unique nonce per encryption in GCM for security guarantees ⓘ |
| resistanceProperty | resistance to forgery under standard GCM security assumptions ⓘ |
| securityProperty |
provable bounds on collision probability
ⓘ
universal hashing ⓘ |
| specifiedAs | core component of the GCM authentication mechanism ⓘ |
| standardizedIn | NIST SP 800-38D NERFINISHED ⓘ |
| standardRole | defines the hash subkey-based authentication in GCM ⓘ |
| subkeyDerivation | derived from block cipher key in GCM ⓘ |
| tagComputation | final hash value is combined with encrypted counter block to form tag ⓘ |
| tagLengthTypical | 128 bits ⓘ |
| usedBy |
IEEE 802.1AE MACsec with AES-GCM
NERFINISHED
ⓘ
IPsec with AES-GCM ⓘ TLS ciphersuites with AES-GCM ⓘ |
| usedFor | computing the GCM authentication tag ⓘ |
| usedIn |
GCM
NERFINISHED
ⓘ
Galois/Counter Mode NERFINISHED ⓘ |
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: GHASH Description of subject: GHASH is a polynomial-based universal hash function used within Galois/Counter Mode (GCM) to provide efficient message authentication over binary fields.
Referenced by (2)
Full triples — surface form annotated when it differs from this entity's canonical label.
subject surface form:
Galois/Counter Mode