An improved 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:
ACNS'06 Proceedings of the 4th international conference on Applied Cryptography and Network Security
Year:
2006

Citing 3
Cited 0

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose an improved Poly1305 MAC, called IPMAC. IPMAC is a refinement of Poly1305 MAC shown by Bernstein. We use only one 16-byte key and one 16-byte nonce for IPMAC while Poly1305 MAC uses two 16-byte keys and one 16-byte nonce, 48-byte in total. The cost of reducing the size of secret keys is almost negligible: only one encryption. Similarly to Poly1305 MAC, our algorithm correctly and efficiently handles messages of arbitrary bit length.