Cryptology ePrint Archive: Report 2017/271
High Order Masking of Look-up Tables with Common Shares
Jean-Sebastien Coron and Franck Rondepierre and Rina Zeitoun
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. When combined, our three techniques lead to a factor 10.7 improvement in efficiency, asymptotically for a large number of shares n. For a practical implementation with a reasonable number of shares, we get a 4.8 speed-up factor compared to the initial countermeasure for AES.
Category / Keywords: secret-key cryptography / Side-channel countermeasure, ISW probing model.
Date: received 24 Mar 2017
Contact author: jean-sebastien coron at uni lu
Available format(s): PDF | BibTeX Citation
Version: 20170325:202645 (All versions of this report)
Short URL: ia.cr/2017/271
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]