CryptoDB
High Order Masking of Look-up Tables with Common Shares
| Authors: |
|
|---|---|
| Download: | |
| Abstract: | Masking is an effective countermeasure against side-channel attacks. In this paper, we improve the efficiency of the high-order masking of look-up tables countermeasure introduced at Eurocrypt 2014, based on a combination of three techniques, and still with a proof of security in the Ishai-Sahai-Wagner (ISW) probing model. The first technique consists in proving security under the stronger t-SNI definition, which enables to use n = t+1 shares instead of n = 2t+1 against t-th order attacks. The second technique consists in progressively incrementing the number of shares within the countermeasure, from a single share to n, thereby reducing the complexity of the countermeasure. The third technique consists in adapting the common shares approach introduced by Coron et al. at CHES 2016, so that half of a randomized look-up table can be pre-computed for multiple SBoxes. We show that our techniques perform well in practice. In theory, the combination of the three techniques should lead to a factor 10.7 improvement in efficiency, for a large number of shares. For a practical implementation with a reasonable number of shares, we get a 4.8 speed-up factor for AES. |
Video from TCHES 2018
BibTeX
@article{tches-2018-28950,
title={High Order Masking of Look-up Tables with Common Shares},
journal={Transactions on Cryptographic Hardware and Embedded Systems},
publisher={Ruhr-Universität Bochum},
volume={2018, Issue 1},
pages={40-72},
url={https://tches.iacr.org/index.php/TCHES/article/view/832},
doi={10.13154/tches.v2018.i1.40-72},
author={Jean-Sébastien Coron and Franck Rondepierre and Rina Zeitoun},
year=2018
}