OPMAC: one-key poly1305 MAC

Authors:
Dayin Wang;Dongdai Lin;Wenling Wu
Affiliations:
Key Laboratory of Information Security, Institute of Software, Chinese Academy of Sciences, Beijing, China;Key Laboratory of Information Security, Institute of Software, Chinese Academy of Sciences, Beijing, China;Key Laboratory of Information Security, Institute of Software, Chinese Academy of Sciences, Beijing, China
Venue:
Inscrypt'06 Proceedings of the Second SKLOIS conference on Information Security and Cryptology
Year:
2006

Citing 6
Cited 0

The security of the cipher block chaining message authentication code

Journal of Computer and System Sciences
Universal Hashing and Authentication Codes

CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
LFSR-based Hashing and Authentication

CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
A Block-Cipher Mode of Operation for Parallelizable Message Authentication

EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
A variant of poly1305 MAC and its security proof

CIS'05 Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part II
The Poly1305-AES message-authentication code

FSE'05 Proceedings of the 12th international conference on Fast Software Encryption

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present One-Key Poly1305 MAC(OPMAC) and prove its security for arbitrary length message. OPMAC is deterministic and takes only one 16-byte key. Previously, Poly1305 MAC is nonce-based and requires two 16-byte keys and a 16-byte nonce, 48-byte in total.