Paper 2016/572

Faster Evaluation of SBoxes via Common Shares

Jean-Sebastien Coron, Aurelien Greuet, Emmanuel Prouff, and Rina Zeitoun

Abstract

We describe a new technique for improving the efficiency of the masking countermeasure against side-channel attacks. Our technique is based on using common shares between secret variables, in order to reduce the number of finite field multiplications. Our algorithms are proven secure in the ISW probing model with $$ shares against $$ probes. For AES, we get an equivalent of $$ non-linear multiplications for every SBox evaluation, instead of $$ in the Rivain-Prouff countermeasure. We obtain similar improvements for other block-ciphers. Our technique is easy to implement and performs relatively well in practice, with roughly a 20% speed-up compared to existing algorithms.