Abstract In CRYPTO 2016, Cogliati and Seurin have proposed a nonce-based MAC called
Encrypted Wegman-Carter with Davies-Meyer (EWCDM), from an n-bit block cipher E and …

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 …

We deal with computational assumptions needed in order to design secure cryptographic
schemes. We suggest a classification of such assumptions based on the complexity of …

Abstract In, Bellare, Pietrzak and Rogaway proved an O⁢(ℓ⁢ q 2/2 n) bound for the PRF
(pseudorandom function) security of the CBC-MAC based on an n-bit random permutation …

In this paper, we introduce a new class of double-block-length hash functions. Using the
ideal cipher model, we prove that these hash functions, dubbed MJH, are asymptotically …

Abstract Preneel, Govaerts, and Vandewalle [6] considered the 64 most basic ways to
construct a hash function H:(0, 1)*→(0, 1) n from a block cipher E:(0, 1) n×(0, 10 n→(0, 1) n …

Pseudorandomness is a classical model for the security of block ciphers. In this paper we
propose convenient tools in order to study it in connection with the Shannon Theory, the …

Abstract At ASIACRYPT 1991, Even and Mansour introduced a block cipher construction
based on a single permutation. Their construction has since been lauded for its simplicity …

Differential and linear attacks are the most widely used cryptanalytic tools to evaluate the
security of symmetric-key cryptography. Since the introduction of differential and linear …

We provide new constructions for Luby-Rackoff block ciphers which are efficient in terms of
computations and key material used. Next, we show that we can make some security …