UMAC
E792085
UMAC is a high-speed, universal hash-based message authentication code designed for efficient and secure data integrity verification in modern cryptographic systems.
All labels observed (1)
| Label | Occurrences |
|---|---|
| UMAC canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T9312198 — 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: UMAC Context triple: [Carter–Wegman MACs, influenced, UMAC]
-
A.
UMI
UMI is the three-letter ISO 3166-1 alpha-3 country code assigned to Kingman Reef, an uninhabited U.S. territory in the central Pacific Ocean.
-
B.
UM
UM is the stock ticker symbol for MRU, the Canadian food and pharmacy retail company Metro Inc.
-
C.
UM
UM is the commonly used abbreviation for Universitas Negeri Malang, a public university in Malang, Indonesia known for its strong focus on education and teacher training.
-
D.
UM
UM is the commonly used abbreviation for the University of Miami, a private research university located in Coral Gables, Florida.
-
E.
UM
UM is the regional vehicle registration code used for the district of Uckermark in the German state of Brandenburg.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Target entity: UMAC Target entity description: UMAC is a high-speed, universal hash-based message authentication code designed for efficient and secure data integrity verification in modern cryptographic systems.
-
A.
UMI
UMI is the three-letter ISO 3166-1 alpha-3 country code assigned to Kingman Reef, an uninhabited U.S. territory in the central Pacific Ocean.
-
B.
UM
UM is the commonly used abbreviation for the University of Miami, a private research university located in Coral Gables, Florida.
-
C.
UM
UM is the regional vehicle registration code used for the district of Uckermark in the German state of Brandenburg.
-
D.
UM
UM is a public research university in Winnipeg, Canada, known as the University of Manitoba.
-
E.
UM
UM is the stock ticker symbol for MRU, the Canadian food and pharmacy retail company Metro Inc.
- F. None of above. chosen
Statements (46)
| Predicate | Object |
|---|---|
| instanceOf |
cryptographic algorithm
ⓘ
message authentication code ⓘ universal hash-based MAC ⓘ |
| applicationDomain |
high-speed data transmission
ⓘ
network protocols ⓘ storage integrity protection ⓘ |
| basedOn | universal hashing ⓘ |
| category | symmetric-key algorithm ⓘ |
| constructionType | hash-then-PRF MAC ⓘ |
| designedFor |
data integrity
ⓘ
high-speed software implementation ⓘ message authentication ⓘ |
| designedToBe | efficient on modern CPUs ⓘ |
| doesNotProvide | confidentiality ⓘ |
| fullName | Universal Message Authentication Code NERFINISHED ⓘ |
| hasProperty |
high throughput
ⓘ
low collision probability for distinct messages ⓘ low per-byte computational cost ⓘ provable bounds on forgery probability ⓘ |
| keyType | symmetric key ⓘ |
| messageInput | arbitrary-length messages ⓘ |
| optimizedFor |
32-bit processors
ⓘ
64-bit processors ⓘ software performance ⓘ |
| outputType | fixed-length authentication tag ⓘ |
| property | provable security under standard assumptions ⓘ |
| provides |
authentication
ⓘ
integrity ⓘ |
| relatedConcept |
Carter-Wegman MAC
NERFINISHED
ⓘ
HMAC NERFINISHED ⓘ VMAC NERFINISHED ⓘ |
| securityDependsOn |
pseudorandomness of underlying block cipher or PRF
ⓘ
secret key ⓘ universal hash family properties ⓘ |
| securityModel | information-theoretic security of hash plus computational security of PRF ⓘ |
| standardizedIn | ISO/IEC 19772 NERFINISHED ⓘ |
| supports |
incremental processing of messages
ⓘ
parallel processing ⓘ |
| tagVerification | recompute-and-compare ⓘ |
| typicalTagLengths |
128 bits
GENERATED
ⓘ
32 bits GENERATED ⓘ 64 bits GENERATED ⓘ 96 bits GENERATED ⓘ |
| uses |
one-time pad style masking of hash output
ⓘ
pseudorandom function ⓘ universal hash function family ⓘ |
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: UMAC Description of subject: UMAC is a high-speed, universal hash-based message authentication code designed for efficient and secure data integrity verification in modern cryptographic systems.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.