Paper 2018/315 Original: eprint.iacr.org/2018/315 ↗
Secure Multiplication for Bitslice Higher-Order Masking: Optimisation and Comparison
Abstract
In this paper, we optimize the performances and compare several recent masking schemes in bitslice on 32-bit arm devices, with a focus on multiplication. Our main conclusion is that efficiency (or randomness) gains always come at a cost, either in terms of composability or in terms of resistance against horizontal attacks. Our evaluations should therefore allow a designer to select a masking scheme based on implementation constraints and security requirements. They also highlight the increasing feasibility of (very) high-order masking that are offered by increasingly powerful embedded devices, with new opportunities of high-security devices in various contexts.
Metadata
- Available format(s)
PDF- Publication info
- Preprint.
- History
- 2018-04-03: last updated
- 2018-04-03: published
- Short URL
- https://ia.cr/2018/315
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2018/315,
author = {Dahmun Goudarzi and Anthony Journault and Matthieu Rivain and François-Xavier Standaert},
title = {Secure Multiplication for Bitslice Higher-Order Masking: Optimisation and Comparison},
howpublished = {Cryptology {ePrint} Archive, Paper 2018/315},
year = {2018},
url = {https://eprint.iacr.org/2018/315}
}