Finding Desirable Substitution Box with SASQUATCH

Manas Wadhwa; Anubhab Baksi; Kai Hu; Anupam Chattopadhyay; Takanori Isobe; Dhiman Saha

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

Abstract

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.

Metadata

Available format(s): PDF
Category: Secret-key cryptography
Publication info: Preprint.
Keywords: sbox ddt lat dbn lbn apn linear 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
History: 2023-05-25: approved; 2023-05-23: received; See all versions
Short URL: https://ia.cr/2023/742
License: CC BY-NC-SA

BibTeX

@misc{cryptoeprint:2023/742,
      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},
      url = {https://eprint.iacr.org/2023/742}
}