Advertisement
Published in:
2014 | OriginalPaper | Chapter
Secure Conversion between Boolean and Arithmetic Masking of Any Order
Authors : Jean-Sébastien Coron, Johann Großschädl, Praveen Kumar Vadnala
Published in: Cryptographic Hardware and Embedded Systems – CHES 2014
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
An effective countermeasure against side-channel attacks is to mask all sensitive intermediate variables with one (or more) random value(s). When a cryptographic algorithm involves both arithmetic and Boolean operations, it is necessary to convert from arithmetic masking to Boolean masking and vice versa. At CHES 2001, Goubin introduced two algorithms for secure conversion between arithmetic and Boolean masks, but his approach can only be applied to first-order masking. In this paper, we present and evaluate new conversion algorithms that are secure against attacks of any order. To convert masks of a size of
k
bits securely against attacks of order
n
, the proposed algorithms have a time complexity of
$\mathcal{O}(n^2 k)$
in both directions and are proven to be secure in the Ishai, Sahai, and Wagner (ISW) framework for private circuits. We evaluate our algorithms using HMAC-SHA-1 as example and report the execution times we achieved on a 32-bit AVR microcontroller.