Skip to Main content Skip to Navigation
New interface
Conference papers

Boomerang Uniformity of Popular S-box Constructions

Abstract : In order to study the resistance of a block cipher against boomerang attacks, a tool called the Boomerang Connectivity Table (BCT) for S-boxes was recently introduced. Very little is known today about the properties of this table especially for bijective S-boxes defined for n variables with n ≡ 0 mod 4. In this work we study the boomerang uniformity of some popular constructions used for building large S-boxes, e.g. for 8 variables, from smaller ones. We show that the BCTs of all the studied constructions have abnormally high values in some positions. This remark permits us in some cases to link the boomerang properties of an S-box with other well-known cryptanalytic techniques on such constructions while in other cases it leads to the discovery of new ones. A surprising outcome concerns notably the Feistel and MISTY networks. While these two structures are very similar, their boomerang uniformity can be very different.
Complete list of metadata

Cited literature [15 references]  Display  Hide  Download
Contributor : Léo Perrin Connect in order to contact the contributor
Submitted on : Friday, December 20, 2019 - 11:06:17 AM
Last modification on : Tuesday, October 25, 2022 - 4:25:21 PM
Long-term archiving on: : Saturday, March 21, 2020 - 3:17:53 PM


Files produced by the author(s)


  • HAL Id : hal-02420970, version 1


Christina Boura, Léo Perrin, Shizhu Tian. Boomerang Uniformity of Popular S-box Constructions. WCC 2019 - The Eleventh International Workshop on Coding and Cryptography, Mar 2019, Saint-Jacut-de-la-Mer, France. ⟨hal-02420970⟩



Record views


Files downloads