Author:
Boukerrou Hamid,Huynh Paul,Lallemand Virginie,Mandal Bimal,Minier Marine
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.
Publisher
Universitatsbibliothek der Ruhr-Universitat Bochum
Subject
Applied Mathematics,Computational Mathematics,Computer Science Applications,Software
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. The reality of backdoored S-Boxes—An eye opener;Journal of Information Security and Applications;2024-02
2. Boomerang Cryptanalysis;Symmetric Cryptography 2;2023-12
3. A novel 5-bit S-box design for lightweight cryptography algorithms;Journal of Information Security and Applications;2023-03
4. Generalized Boomerang Connectivity Table and Improved Cryptanalysis of GIFT;Information Security and Cryptology;2023
5. Differential cryptanalysis of WARP;Journal of Information Security and Applications;2022-11