Proving tight bounds on information-theoretic indistinguishability is a central problem in
symmetric cryptography. This paper introduces a new method for information-theoretic …

We present Orthros, a 128-bit block pseudorandom function. It is designed with primary
focus on latency of fully unrolled circuits. For this purpose, we adopt a parallel structure …

We propose a new mode of operation called ZMAC allowing to construct a (stateless and
deterministic) message authentication code (MAC) from a tweakable block cipher (TBC) …

Abstract Liskov, Rivest and Wagner laid the theoretical foundations for tweakable block
ciphers (TBC). In a seminal paper, they proposed two (up to) birthday-bound secure design …

Pseudorandom functions are traditionally built upon block ciphers, but with the trend of
permutation based cryptography, it is a natural question to investigate the design of …

Abstract Encrypt-then-MAC (EtM) is a popular mode for authenticated encryption (AE).
Unfortunately, almost all designs following the EtM paradigm, including the AE suites for …

Abstract At CRYPTO 2016, Cogliati and Seurin have proposed a highly secure nonce-based
MAC called Encrypted Wegman-Carter with Davies-Meyer (EWCDM EWCDM) construction …

In ICISC-05, and in the ePrint 2010/287, Patarin claimed a lower bound on the number of
tuples of-bit strings satisfying for such that, are distinct and. This result is known as Mirror …

In CRYPTO'03, Patarin conjectured a lower bound on the number of distinct solutions (P
1,…, P q)∈({0, 1} n) q satisfying a system of equations of the form X i⊕ X j= λ i, j such that P …

At CRYPTO'12, Landecker et al. introduced the cascaded LRW2 (or CLRW2) construction
and proved that it is a secure tweakable block cipher up to roughly 2^ 2n/3 2 2 n/3 queries …