A variant of poly1305 MAC and its security proof

Authors:
Dayin Wang;Dongdai Lin;Wenling Wu
Affiliations:
SKLOIS Lab, Institute of Software, Chinese Academy of Science, Beijing, China;SKLOIS Lab, Institute of Software, Chinese Academy of Science, Beijing, China;SKLOIS Lab, Institute of Software, Chinese Academy of Science, Beijing, China
Venue:
CIS'05 Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part II
Year:
2005

Citing 5
Cited 1

How to construct random functions

Journal of the ACM (JACM)
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
The Poly1305-AES message-authentication code

FSE'05 Proceedings of the 12th international conference on Fast Software Encryption
Stronger security bounds for wegman-carter-shoup authenticators

EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques

OPMAC: one-key poly1305 MAC

Inscrypt'06 Proceedings of the Second SKLOIS conference on Information Security and Cryptology

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give a variant of Poly1305 MAC and prove its security viewing this MAC as a Carter-Wegman MAC. The proposed variant not only keeps all the good properties of the Poly1305, but also makes Poly1305 deterministic.