Faster Evaluation of SBoxes via Common Shares

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 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.
Complete list of metadatas

Cited literature [14 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01399578
Contributor : Emmanuel Prouff <>
Submitted on : Saturday, November 19, 2016 - 4:32:25 PM
Last modification on : Thursday, March 21, 2019 - 1:07:49 PM
Long-term archiving on : Tuesday, March 21, 2017 - 12:34:23 PM

File

pararp_proce.pdf
Files produced by the author(s)

Identifiers

Citation

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⟩

Share

Metrics

Record views

543

Files downloads

184