Sboxgates: A program for finding low gate count implementations of S-boxes

Marcus Dansarie

doi:10.21105/joss.02946

Abstract

sboxgates: A program for finding low gate count implementations of S-boxes

Highlights

Cipher specifications generally describe S-boxes using their lookup tables, they can be described as boolean functions or logic gate circuits. sboxgates, which is presented here, finds equivalent logic gate circuits for S-boxes, given their lookup table specification
Knowledge of a low gate count logic gate representation of an S-box can be of interest both when assessing the security of a cipher through cryptanalysis and when implementing it in hardware or software
Sboxgates implements Kwan’s algorithm and supports generation of logic circuits for Sboxes with up to 8 input bits using any subset of the 16 possible two-input boolean functions

Summary

Introduction

Cipher specifications generally describe S-boxes using their lookup tables, they can be described as boolean functions or logic gate circuits. Sboxgates, which is presented here, finds equivalent logic gate circuits for S-boxes, given their lookup table specification. The software can convert the output files into C or CUDA (a parallel computing platform for Nvidia GPUs) source code.

Results

Conclusion