Cryptology ePrint Archive: Report 2016/1023

Constant-Time Higher-Order Boolean-to-Arithmetic Masking

Michael Hutter and Michael Tunstall

Abstract: Converting a Boolean mask to an arithmetic mask, and vice versa, is often required in implementing side-channel resistant instances of cryptographic algorithms that mix Boolean and arithmetic operations. In this paper, we describe a method for converting a Boolean mask to an arithmetic mask that runs in constant time for a fixed order. We propose explicit algorithms for a second-order secure Boolean-to-arithmetic mask conversion that uses 31 instructions and for a third-order secure mask conversion that uses 74 instructions. We show that our solution is more efficient than previously proposed methods for any choice of masking-scheme order, typically by several orders of magnitude.

Category / Keywords: implementation / Side-channel analysis

Date: received 27 Oct 2016, last revised 2 Mar 2018

Contact author: michael tunstall at cryptography com

Available format(s): PDF | BibTeX Citation

Note: Updated proofs from t-NI to t-SNI

Version: 20180302:230329 (All versions of this report)

Short URL: ia.cr/2016/1023

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]