Reconstructing S-Boxes from Cryptographic Tables with Milp

Abstract: Reconstructing an S-box from a cryptographic table such as difference distribution table (DDT), linear approximation table (LAT), differential-linear connectivity table (DLCT) or boomerang connectivity table (BCT) is one of the fundamental problems in symmetric-key cryptography. Till now, there are only very few known methods which can reconstruct an S-box from a given table: guess-and-determine algorithms of Boura et al. (DCC 2019) and Tian et al. (DCC 2020), sign determination algorithm of Dunkelman et al. (ToSC 2019) and STP based approach of Lu et al. (DCC 2022). In this paper we consider the reconstruction problem in an even more challenging setup where one needs to reconstruct S-boxes from a partial cryptographic table. We are able to reconstruct S-boxes when only a few number of rows of a cryptographic table is given. This problem has never been studied in the literature. We apply mixed integer linear programming (MILP) as the key tool for solving this problem. Needless to s.... https://tosc.iacr.org/index.php/ToSC/article/view/11815

Object Details

• Location: Deutsche Nationalbibliothek Frankfurt am Main
• Extent: Online-Ressource
• Language: Englisch

References and Relationships

• Bibliographic citation: Reconstructing S-Boxes from Cryptographic Tables with Milp ; volume:2024 ; number:3 ; year:2024 ; IACR transactions on symmetric cryptology ; 2024, Heft 3 (2024)

Contributors, Places and Time

• Creator: Rohit, Raghvendra ; Sarkar, Sumanta

Further information

• DOI: 10.46586/tosc.v2024.i3.200-237
• URN: urn:nbn:de:101:1-2409251858241.794835193708
• Rights: Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
• Last update: 15.08.2025, 7:26 AM CEST