Abstract
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. © 2011 Springer-Verlag Berlin Heidelberg.
Author supplied keywords
Cite
CITATION STYLE
Liang, B., Wu, W., & Zhang, L. (2011). BCBC: A more efficient MAC algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6672 LNCS, pp. 233–246). https://doi.org/10.1007/978-3-642-21031-0_18
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
