Paper Info
Title
Constant-Time Higher-Order Boolean-to-Arithmetic Masking.
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 and has quadratic complexity as the security order increases, a significant improvement in previous work that has exponential complexity. 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 second-order secure algorithm is at least an order of magnitude faster and our third-order secure algorithm is more than twice as fast as other algorithms in the literature.
Year
DOI
Venue
2016
10.1007/s13389-018-0191-z
IACR Cryptology ePrint Archive
Keywords
Field
DocType
Side-channel analysis, Higher-order DPA, Mask switching, Countermeasures, Boolean-to-arithmetic mask conversion
Quadratic complexity,Masking (art),Cryptography,Computer science,Arithmetic,Boolean algebra,Exponential complexity,Order of magnitude,Versa
Journal
Volume
Issue
ISSN
2016
2
2190-8508
Citations 
PageRank 
References 
1
0.35
0
Authors
2
Name
Order
Citations
PageRank
Michael Hutter134525.26
Michael Tunstall2483.41