Search
Search Results
-
Quantum Query Lower Bounds for Key Recovery Attacks on the Even-Mansour Cipher
The Even-Mansour (EM) cipher is one of the famous constructions for a block cipher. Kuwakado and Morii demonstrated that a quantum adversary can...
-
Minimizing Even-Mansour Ciphers for Sequential Indifferentiability (Without Key Schedules)
Iterated Even-Mansour (IEM) schemes consist of a small number of fixed permutations separated by round key additions. They enjoy provable security,...
-
BBB security for 5-round even-Mansour-based key-alternating Feistel ciphers
In this paper, we study the security of the Key-Alternating Feistel (KAF) ciphers, a class of key alternating ciphers with the Feistel structure,...
-
On the Resilience of Even-Mansour to Invariant Permutations
Symmetric cryptographic primitives are often exposed to invariances: deterministic relations between plaintexts and ciphertexts that propagate...
-
Impossibility of Indifferentiable Iterated Blockciphers from 3 or Less Primitive Calls
Virtually all modern blockciphers are iterated. In this paper, we ask: to construct a secure iterated blockcipher “non-trivially”, how many calls to...
-
Minimizing the Two-Round Tweakable Even-Mansour Cipher
In CRYPTO 2015, Cogliati et al. have proposed one-round tweakable Even-Mansour (1-TEM) cipher constructed out of a single n-bit public permutation...
-
Low-Memory Attacks Against Two-Round Even-Mansour Using the 3-XOR Problem
The iterated Even-Mansour construction is an elegant construction that idealizes block cipher designs such as the AES. In this work we focus on the...
-
Generic Attack on Iterated Tweakable FX Constructions
Tweakable block ciphers are increasingly becoming a common primitive to build new resilient modes as well as a concept for multiple dedicated...
-
Minimizing the Two-Round Even–Mansour Cipher
The r -round (iterated) Even–Mansour cipher (also known as key-alternating cipher ) defines a block cipher from r fixed public n -bit permutations
... 
-
A Modular Approach to the Security Analysis of Two-Permutation Constructions
Constructions based on two public permutation calls are very common in today’s cryptographic community. However, each time a new construction is...
-
Propagation properties of a non-linear map** based on squaring in odd characteristic
Many modern cryptographic primitives for hashing and (authenticated) encryption make use of constructions that are instantiated with an iterated...
-
LLLWBC: A New Low-Latency Light-Weight Block Cipher
Lightweight cipher suitable for resource constrained environment is crucial to the security of applications such as RFID, Internet of Things, etc....
-
From Farfalle to Megafono via Ciminion: The PRF Hydra for MPC Applications
The area of multi-party computation (MPC) has recently increased in popularity and number of use cases. At the current state of the art, Ciminion, a...
-
Beyond Quadratic Speedups in Quantum Attacks on Symmetric Schemes
In this paper, we report the first quantum key-recovery attack on a symmetric block cipher design, using classical queries only, with a more than...
-
Just tweak! Asymptotically optimal security for the cascaded LRW1 tweakable blockcipher
Recent work of Bao et al. (in: Canteaut and Ishai (eds) EUROCRYPT 2020, Part II. LNCS. Springer, Heidelberg 2020) repopularized tweakable...
-
Quantum Attacks on Hash Constructions with Low Quantum Random Access Memory
At ASIACRYPT 2022, Benedikt, Fischlin, and Huppert proposed the quantum herding attacks on iterative hash functions for the first time. Their attack...
-
The state diagram of \(\chi \)
In symmetric cryptography, block ciphers, stream ciphers and permutations often make use of a round function and many round functions consist of a...
-
On Quantum Related-Key Attacks on Iterated Even-Mansour Ciphers
The impacts that quantum computers will have on cryptography have become more and more important to study for not only public key cryptography but...
-
Algebraic Attacks on Round-Reduced Rain and Full AIM-III
Picnic is a NIST PQC Round 3 Alternate signature candidate that builds upon symmetric primitives following the MPC-in-the-head paradigm. Recently,...
-
Permutation-Based Deterministic Authenticated Encryption with Minimum Memory Size
Deterministic authenticated encryption (DAE) provides data integrity and authenticity with certain robustness. Previous DAE schemes for low memory...