The majority of current attacks on reduced-round variants of block ciphers seeks to maximize
the number of rounds that can be broken, using less data than the entire codebook and less …

Various message authentication codes (MACs), including HMAC-Streebog and Streebog-K,
are based on the keyless hash function Streebog. Under the assumption that the …

Abstract SUM-ECBC (Yasuda, CT-RSA 2010) is the first beyond birthday bound (BBB)
secure block cipher based deterministic MAC. After this work, some more BBB secure …

We suggest some simple variants of the CBC MAC that enable the efficient authentication of
arbitrary-length messages. Our constructions use three keys, K1, K2, K3, to avoid …

In this paper, we introduce a new class of double-block-length hash functions. In the ideal
cipher model (for n-bit blocks), we prove that these hash functions, dubbed MJH, are …

Let F be some block cipher (eg., DES) with block length l. The cipher block chaining
message authentication code (CBC MAC) specifies that an m-block message x= x1… xm be …

Recent collision-finding attacks against hash functions such as MD5 and SHA-1 motivate the
use of provably collision-resistant (CR) functions in their place. Finding a collision in a …

We present a new hash-function, which provides 2n-bit hash-results, using any n-bit
symmetric block cipher algorithm. This hash-function can be considered as a extension of an …

We present blockcipher-based MACs (Message Authentication Codes) that have beyond the
birthday bound security without message length in the sense of PRF (Pseudo-Random …

Abstract Preneel, Govaerts, and Vandewalle (1993) considered the 64 most basic ways to
construct a hash function H:\;\:{0,1\}^*→{0,1\}^n from a blockcipher E:\;\:{0,1\}^n*{0,1\}^n→{0 …