On the Feistel Counterpart of the Boomerang Connectivity Table - Archive ouverte HAL Access content directly
Journal Articles IACR Transactions on Symmetric Cryptology Year : 2020

On the Feistel Counterpart of the Boomerang Connectivity Table

(1) , (1) , (1) , (1) , (1)
1

Abstract

At Eurocrypt 2018, Cid et al. introduced the Boomerang Connectivity Table (BCT), a tool to compute the probability of the middle round of a boomerang distinguisher from the description of the cipher’s Sbox(es). Their new table and the following works led to a refined understanding of boomerangs, and resulted in a series of improved attacks. Still, these works only addressed the case of Substitution Permutation Networks, and completely left out the case of ciphers following a Feistel construction. In this article, we address this lack by introducing the FBCT, the Feistel counterpart of the BCT. We show that the coefficient at row Δi, ∇o corresponds to the number of times the second order derivative at points Δi, ∇o) cancels out. We explore the properties of the FBCT and compare it to what is known on the BCT. Taking matters further, we show how to compute the probability of a boomerang switch over multiple rounds with a generic formula.
Fichier principal
Vignette du fichier
8568-Article Text-5118-1-10-20200507.pdf (806.89 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-02945065 , version 1 (26-10-2020)

Identifiers

Cite

Hamid Boukerrou, Paul Huynh, Virginie Lallemand, Bimal Mandal, Marine Minier. On the Feistel Counterpart of the Boomerang Connectivity Table: Introduction and Analysis of the FBCT. IACR Transactions on Symmetric Cryptology, 2020, 2020 (1), pp.331-362. ⟨10.13154/tosc.v2020.i1.331-362⟩. ⟨hal-02945065⟩
218 View
173 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More