Sciweavers

Share
ASIACRYPT
2007
Springer

On Efficient Message Authentication Via Block Cipher Design Techniques

11 years 3 months ago
On Efficient Message Authentication Via Block Cipher Design Techniques
In an effort to design a MAC scheme that is built using block cipher components and runs faster than the modes of operation for message authentication, Daemen and Rijmen have proposed a generic MAC construction ALRED and a concrete ALRED instance Pelican. The Pelican MAC uses four rounds of AES as a building block to compute the authentication tag in a CBC-like manner. It is about 2.5 times faster than a CBC-MAC with AES, but it is not proven secure. Minematsu and Tsunoo observed that one can build almost universal (AU2) hash functions using differentially uniform permutations (e.g., four AES rounds with independent keys), and hence, provably secure MAC schemes as well. They proposed two MAC schemes MT-MAC and PC-MAC. MT-MAC hashes the message using a Wegman-Carter binary tree. Its speedup for long messages approaches 2.5, but it is not very memory efficient. PC-MAC hashes the message in a CBC-like manner. It is more memory efficient. However, its speedup over the message authenticatio...
Goce Jakimoski, K. P. Subbalakshmi
Added 12 Aug 2010
Updated 12 Aug 2010
Type Conference
Year 2007
Where ASIACRYPT
Authors Goce Jakimoski, K. P. Subbalakshmi
Comments (0)
books