PMAC message authentication code
E437868
PMAC (Parallelizable Message Authentication Code) is a cryptographic message authentication scheme designed for efficient, parallelizable computation of authentication tags over data.
All labels observed (1)
| Label | Occurrences |
|---|---|
| PMAC message authentication code canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T4405002 — 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: PMAC message authentication code Context triple: [Phillip Rogaway, notableWork, PMAC message authentication code]
-
A.
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.
-
B.
HMAC
HMAC (Hash-based Message Authentication Code) is a cryptographic construction that combines a secret key with a hash function to provide data integrity and authentication.
-
C.
Poly1305
Poly1305 is a high-speed message authentication code (MAC) algorithm commonly used with stream ciphers like ChaCha20 to provide data integrity and authenticity.
-
D.
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.
-
E.
AES-Poly1305
AES-Poly1305 is an authenticated encryption scheme that pairs the AES block cipher with the Poly1305 message authentication code to provide both confidentiality and 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: PMAC message authentication code Target entity description: PMAC (Parallelizable Message Authentication Code) is a cryptographic message authentication scheme designed for efficient, parallelizable computation of authentication tags over data.
-
A.
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.
-
B.
HMAC
HMAC (Hash-based Message Authentication Code) is a cryptographic construction that combines a secret key with a hash function to provide data integrity and authentication.
-
C.
Poly1305
Poly1305 is a high-speed message authentication code (MAC) algorithm commonly used with stream ciphers like ChaCha20 to provide data integrity and authenticity.
-
D.
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.
-
E.
AES-Poly1305
AES-Poly1305 is an authenticated encryption scheme that pairs the AES block cipher with the Poly1305 message authentication code to provide both confidentiality and integrity.
- F. None of above. chosen
Statements (46)
| Predicate | Object |
|---|---|
| instanceOf |
cryptographic primitive
ⓘ
message authentication code ⓘ |
| abbreviation | PMAC NERFINISHED ⓘ |
| advantage |
high throughput on parallel hardware
ⓘ
no need for IV or nonce ⓘ |
| application |
authenticated encryption schemes
ⓘ
file integrity protection ⓘ network protocol authentication ⓘ |
| basedOn | block cipher ⓘ |
| blockProcessing | each block multiplied by distinct offset in finite field ⓘ |
| computes | authentication tag ⓘ |
| constructionType | XOR-and-shift-based MAC construction ⓘ |
| designedFor | message authentication ⓘ |
| designedToBe | rate-1 MAC (one block-cipher call per message block) ⓘ |
| domain | symmetric key cryptography ⓘ |
| fullName | Parallelizable Message Authentication Code NERFINISHED ⓘ |
| hasMode |
PMAC1
ⓘ
PMAC2 ⓘ |
| hasSecurityModel | provable security ⓘ |
| hasVariant | lightweight PMAC variants for constrained devices ⓘ |
| influenced | later parallel MAC constructions ⓘ |
| input | message ⓘ |
| introducedBy | Phillip Rogaway NERFINISHED ⓘ |
| keyType | symmetric key ⓘ |
| output | fixed-length tag ⓘ |
| property |
deterministic
ⓘ
length-preserving tag size relative to block size ⓘ nonce-free ⓘ |
| providesProperty |
data integrity
ⓘ
message authentication ⓘ unforgeability ⓘ |
| publicationYear | 2001 ⓘ |
| publishedIn | Journal of Cryptology NERFINISHED ⓘ |
| relatedTo |
CBC-MAC
NERFINISHED
ⓘ
CMAC NERFINISHED ⓘ GMAC NERFINISHED ⓘ XCBC NERFINISHED ⓘ |
| securityReducesTo | pseudorandom permutation security of underlying block cipher ⓘ |
| standardizationStatus | not widely standardized compared to CMAC ⓘ |
| supports | parallelizable computation ⓘ |
| supportsOperation |
online processing of message blocks
ⓘ
parallel processing of message blocks ⓘ |
| tagVerification | recompute-and-compare ⓘ |
| typicalBlockCipher | AES NERFINISHED ⓘ |
| uses | pseudorandom permutation ⓘ |
| usesMathematicalStructure | finite field over block size ⓘ |
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: PMAC message authentication code Description of subject: PMAC (Parallelizable Message Authentication Code) is a cryptographic message authentication scheme designed for efficient, parallelizable computation of authentication tags over data.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.