Information-theoretic indistinguishability via the chi-squared method
Proving tight bounds on information-theoretic indistinguishability is a central problem in
symmetric cryptography. This paper introduces a new method for information-theoretic …
symmetric cryptography. This paper introduces a new method for information-theoretic …
Quantum linearization attacks
Recent works have shown that quantum period-finding can be used to break many popular
constructions (some block ciphers such as Even-Mansour, multiple MACs and AEs...) in the …
constructions (some block ciphers such as Even-Mansour, multiple MACs and AEs...) in the …
Encrypted davies-meyer and its dual: Towards optimal security using mirror theory
Abstract At CRYPTO 2016, Cogliati and Seurin introduced the Encrypted Davies-Meyer
construction, p_2 (p_1 (x) ⊕ x) for two n-bit permutations p_1, p_2, and proved security up to …
construction, p_2 (p_1 (x) ⊕ x) for two n-bit permutations p_1, p_2, and proved security up to …
How to build pseudorandom functions from public random permutations
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 …
permutation based cryptography, it is a natural question to investigate the design of …
Beyond birthday bound secure MAC in faulty nonce model
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 …
Unfortunately, almost all designs following the EtM paradigm, including the AE suites for …
Blockcipher-based MACs: beyond the birthday bound without message length
Y Naito - International Conference on the Theory and …, 2017 - Springer
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 …
birthday bound security without message length in the sense of PRF (Pseudo-Random …
Encrypt or decrypt? to make a single-key beyond birthday secure nonce-based MAC
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 …
MAC called Encrypted Wegman-Carter with Davies-Meyer (EWCDM EWCDM) construction …
Proof of Mirror Theory for a Wide Range of
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 …
1,…, P q)∈({0, 1} n) q satisfying a system of equations of the form X i⊕ X j= λ i, j such that P …
Single key variant of PMAC_Plus
Abstract In CRYPTO 2011, Yasuda proposed PMAC_Plus message authentication code
based on an $ n $-bit block cipher. Its design principle inherits the well known PMAC …
based on an $ n $-bit block cipher. Its design principle inherits the well known PMAC …
Understanding the duplex and its security
B Mennink - Cryptology ePrint Archive, 2022 - eprint.iacr.org
At SAC 2011, Bertoni et al. introduced the keyed duplex construction as a tool to build
permutation based authenticated encryption schemes. The construction was generalized to …
permutation based authenticated encryption schemes. The construction was generalized to …