Some group-theoretical results on Feistel Networks in a long-key scenario

12/14/2019
by   Riccardo Aragona, et al.
0

The study of the trapdoors that can be hidden in a block cipher is and has always been a high-interest topic in symmetric cryptography. In this paper we focus on Feistel-network-like ciphers in a classical long-key scenario and we investigate some conditions which make such a construction immune to the partition-based attack introduced recently by Bannier et al.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/06/2021

Beyond quadratic speedups in quantum attacks on symmetric schemes

In this paper, we report the first quantum key-recovery attack on a symm...
research
11/14/2018

Regular subgroups with large intersection

In this paper we study the relationships between the elementary abelian ...
research
10/21/2019

Cryptanalysis of two schemes of Baba et al. by linear algebra methods

We show that the attacks based on the linear decomposition method introd...
research
11/03/2020

On the primitivity of Lai-Massey schemes

In symmetric cryptography, the round functions used as building blocks f...
research
06/06/2018

The stabilizer for n-qubit symmetric states

The stabilizer group for an n-qubit state |ϕ〉 is the set of all invertib...
research
10/20/2020

Collusion attack and counterattack on the quantum key agreement via non-maximally entangled cluster states

Recently, Li et al. (Int J Theor Phys: DOI: 10.1007/s10773-020-04588-w, ...
research
09/22/2022

Equivariant Transduction through Invariant Alignment

The ability to generalize compositionally is key to understanding the po...

Please sign up or login with your details

Forgot password? Click here to reset