Paper 2016/715

Uniform First-Order Threshold Implementations

Tim Beyne and Begül Bilgin

Abstract

Most masking schemes used as a countermeasure against side-channel analysis attacks require an extensive amount of fresh random bits on the fly. This is burdensome especially for lightweight cryptosystems. Threshold implementations (TIs) that are secure against firstorder attacks have the advantage that fresh randomness is not required if the sharing of the underlying function is uniform. However, finding uniform realizations of nonlinear functions that also satisfy other TI properties can be a challenging task. In this paper, we discuss several methods that advance the search for uniformly shared functions for TIs. We focus especially on three-share implementations of quadratic functions due to their low area footprint. Our methods have low computational complexity even for 8-bit Boolean functions.

Metadata
Available format(s)
PDF
Publication info
Preprint.
Keywords
boolean functionscorrection termsmaskingrandomnessthreshold implementationsuniformity
Contact author(s)
tim beyne @ student kuleuven be
History
2016-07-21: received
Short URL
https://ia.cr/2016/715
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2016/715,
      author = {Tim Beyne and Begül Bilgin},
      title = {Uniform First-Order Threshold Implementations},
      howpublished = {Cryptology ePrint Archive, Paper 2016/715},
      year = {2016},
      note = {\url{https://eprint.iacr.org/2016/715}},
      url = {https://eprint.iacr.org/2016/715}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.