On Optimality of d + 1 TI Shared Functions of 8 Bits or Less

Dušan Božilov

Paper 2020/570

On Optimality of d + 1 TI Shared Functions of 8 Bits or Less

Dušan Božilov

Abstract

We present a methodology for finding minimal number of output shares in $d + 1$ TI by modeling the sharing as set covering problem and using different discrete optimization techniques to find solutions. We demonstrate the results of our technique by providing optimal or near-optimal sharings of several classes of Boolean functions of any degree up to 8 variables, for first and second order TI. These solutions present new lower bounds for the total number of shares for these types of functions

Metadata

Available format(s): PDF
Publication info: Preprint. MINOR revision.
Keywords: Threshold Implementation and SCA and Masking
Contact author(s): dusan bozilov @ esat kuleuven be
History: 2020-05-16: received
Short URL: https://ia.cr/2020/570
License: CC BY

BibTeX

@misc{cryptoeprint:2020/570,
      author = {Dušan Božilov},
      title = {On Optimality of d + 1 {TI} Shared Functions of 8 Bits or Less},
      howpublished = {Cryptology {ePrint} Archive, Paper 2020/570},
      year = {2020},
      url = {https://eprint.iacr.org/2020/570}
}