Montgomery prime hashing for message authentication

Authors:
Douglas L. Whiting;Michael J. Sabin
Affiliations:
Hifn, Carlsbad, CA;Independent Consultant, Sunnyvale, CA
Venue:
CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
Year:
2003

Citing 5
Cited 0

The security of the cipher block chaining message authentication code

Journal of Computer and System Sciences
XOR MACs: New Methods for Message Authentication Using Finite Pseudorandom Functions

CRYPTO '95 Proceedings of the 15th 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
Fast Encryption and Authentication: XCBC Encryption and XECB Authentication Modes

FSE '01 Revised Papers from the 8th International Workshop on Fast Software Encryption
On the Security of Randomized CBC-MAC Beyond the Birthday Paradox Limit: A New Construction

FSE '02 Revised Papers from the 9th International Workshop on Fast Software Encryption

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose TMAC. TMAC is a refinement of XCBC such that it requires only two keys while XCBC requires three keys. More precisely, TMAC requires only (k + n)-bit keys while XCBC requires (k + 2n)-bit keys, where k is the key length of the underlying block cipher E and n is its block length. We achieve this by using a universal hash function and the cost is almost negligible. Similar to XCBC, the domain is {0, 1}* and it requires no extra invocation of E even if the size of the message is a multiple of n.