Paper 2023/742

Finding Desirable Substitution Box with SASQUATCH

Manas Wadhwa, Indian Institute of Technology, Bhilai, India
Anubhab Baksi, Nanyang Technological University
Kai Hu, Nanyang Technological University
Anupam Chattopadhyay, Nanyang Technological University
Takanori Isobe, University of Hyogo, Kobe, Japan
Dhiman Saha, Indian Institute of Technology Bhilai

This paper presents ``SASQUATCH'', an open-source tool, that aids in finding an unknown substitution box (SBox) given its properties. The inspiration of our work can be directly attributed to the DCC 2022 paper by Lu, Mesnager, Cui, Fan and Wang. Taking their work as the foundation (i.e., converting the problem of SBox search to a satisfiability modulo theory instance and then invoking a solver), we extend in multiple directions (including -- but not limiting to -- coverage of more options, imposing time limit, parallel execution for multiple SBoxes, non-bijective SBox), and package everything within an easy-to-use interface. We also present ASIC benchmarks for some of the SBoxes.

Available format(s)
Secret-key cryptography
Publication info
sboxddtlatdbnlbnapnlinear structure
Contact author(s)
manasw @ iitbhilai ac in
anubhab baksi @ ntu edu sg
kai hu @ ntu edu sg
anupam @ ntu edu sg
takanori isobe @ ai u-hyogo ac jp
dhiman @ iitbhilai ac in
2023-05-25: approved
2023-05-23: received
See all versions
Short URL
Creative Commons Attribution-NonCommercial-ShareAlike


      author = {Manas Wadhwa and Anubhab Baksi and Kai Hu and Anupam Chattopadhyay and Takanori Isobe and Dhiman Saha},
      title = {Finding Desirable Substitution Box with SASQUATCH},
      howpublished = {Cryptology ePrint Archive, Paper 2023/742},
      year = {2023},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.