Faster Evaluation of SBoxes via Common Shares - Archive ouverte HAL Access content directly
Conference Papers Year : 2016

Faster Evaluation of SBoxes via Common Shares


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 n t + 1 shares against t probes. For AES, we get an equivalent of 2.8 non-linear multiplications for every SBox evaluation, instead of 4 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.
Fichier principal
Vignette du fichier
pararp_proce.pdf (407.57 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01399578 , version 1 (19-11-2016)



Jean-Sébastien Coron, Aurélien Greuet, Emmanuel Prouff, Rina Zeitoun. Faster Evaluation of SBoxes via Common Shares. 18th International Conference on Cryptographic Hardware and Embedded Systems (CHES 2016), Aug 2016, Santa Barbara, CA, United States. pp.498 - 514, ⟨10.1007/978-3-662-53140-2_24⟩. ⟨hal-01399578⟩
446 View
219 Download



Gmail Facebook X LinkedIn More