[Resource Topic] 2023/1426: Arithmetic Circuit Implementations of S-boxes for SKINNY and PHOTON in MPC

Welcome to the resource topic for 2023/1426

Arithmetic Circuit Implementations of S-boxes for SKINNY and PHOTON in MPC

Authors: Aysajan Abidin, Erik Pohle, Bart Preneel


Secure multi-party computation (MPC) enables multiple distrusting parties to compute a function while keeping their respective inputs private. In a threshold implementation of a symmetric primitive, e.g., of a block cipher, each party holds a share of the secret key or of the input block. The output block is computed without reconstructing the secret key. This enables the construction of distributed TPMs or transciphering for secure data transmission in/out of the MPC context.
This paper investigates implementation approaches for the lightweight primitives SKINNY and PHOTON in arithmetic circuits.
For these primitives, we identify arithmetic expressions for the S-box that result in smaller arithmetic circuits compared to the Boolean expressions from the literature.
We validate the optimization using a generic actively secure MPC protocol and obtain 18% faster execution time with 49% less communication data for SKINNY-64-128 and 27% to 74% faster execution time with 49% to 81% less data for PHOTON P_{100} and P_{288}.
Furthermore, we find a new set of parameters for the heuristic method of polynomial decomposition, introduced by Coron, Roy and Vivek, specialized for SKINNY’s 8-bit S-box. We reduce the multiplicative depth from 9 to 5.

ePrint: https://eprint.iacr.org/2023/1426

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .