BCBC: A More Efficient MAC Algorithm

In this paper, we construct a new MAC algorithm BCBC-MAC from a block cipher and a fixed function. BCBC-MAC is provably secure under the assumptions that the block cipher is pseudo-random and the fixed function is differentially uniform and preimage-sparse. Such a kind of fixed function is easy to c...

Full description

Saved in:
Bibliographic Details
Published inInformation Security Practice and Experience pp. 233 - 246
Main Authors Liang, Bo, Wu, Wenling, Zhang, Liting
Format Book Chapter
LanguageEnglish
Published Berlin, Heidelberg Springer Berlin Heidelberg 2011
SeriesLecture Notes in Computer Science
Subjects
CBC MAC
message authentication
provable security
Online AccessGet full text

Cover

More Information
Summary:In this paper, we construct a new MAC algorithm BCBC-MAC from a block cipher and a fixed function. BCBC-MAC is provably secure under the assumptions that the block cipher is pseudo-random and the fixed function is differentially uniform and preimage-sparse. Such a kind of fixed function is easy to construct and we give several examples, some of which runs very fast. Therefore, BCBC-MAC can be faster than modern block-cipher-based MACs, such as CBC-MAC, OMAC, etc. Furthermore, our scheme can be partly paralleled. Thus, BCBC-MAC offers high efficiency.
ISBN:3642210309
9783642210303
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-642-21031-0_18