[Resource Topic] 2018/922: Optimized Threshold Implementations: Securing Cryptographic Accelerators for Low-Energy and Low-Latency Applications

Welcome to the resource topic for 2018/922

Title:
Optimized Threshold Implementations: Securing Cryptographic Accelerators for Low-Energy and Low-Latency Applications

Authors: Dušan Božilov, Miroslav Knežević, Ventzislav Nikov

Abstract:

Threshold implementations have emerged as one of the most popular masking countermeasures for hardware implementations of cryptographic primitives. In the original version of TI, the number of input shares was dependent on both security order d and algebraic degree of a function t, namely td + 1. At CRYPTO 2015, a new method was presented yielding to a d-th order secure implementation using d+1 input shares. In this work, we first provide a construction for d+1 TI sharing which achieves the minimal number of output shares for any n-input Boolean function of degree t=n-1. Furthermore, we present a heuristic for minimizing the number of output shares for higher order td + 1 TI. Finally, we demonstrate the applicability of our results on d+1 and td+1 TI versions, for first- and second-order secure, low-latency and low-energy implementations of the PRINCE block cipher.

ePrint: https://eprint.iacr.org/2018/922

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 .