Secure Conversion between Boolean and Arithmetic Masking of Any Order

摘要: An effective countermeasure against side-channel attacks is to mask all sensitive intermediate variables with one or more random values. When a cryptographic algorithm involves both arithmetic and Boolean operations, it necessary convert from masking vice versa. At CHES 2001, Goubin introduced two algorithms for secure conversion between masks, but his approach can only be applied first-order masking. In this paper, we present evaluate new that are of any order. To masks size ki¾?bits securely order n, the proposed have time complexity $\mathcal{O}n^2 k$ in directions proven Ishai, Sahai, Wagner ISW framework private circuits. We our using HMAC-SHA-1 as example report execution times achieved on 32-bit AVR microcontroller.