BCBC: a more efficient MAC algorithm
B Liang, W Wu, L Zhang - … , ISPEC 2011, Guangzhou, China, May 30–June …, 2011 - Springer
B Liang, W Wu, L Zhang
Information Security Practice and Experience: 7th International Conference …, 2011•SpringerIn 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 …
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 …
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.
Springer
Showing the best result for this search. See all results