Secure Multiplication for Bitslice Higher-Order Masking: Optimisation and Comparison

Dahmun Goudarzi; Anthony Journault; Matthieu Rivain; François-Xavier Standaert

Paper 2018/315

Secure Multiplication for Bitslice Higher-Order Masking: Optimisation and Comparison

Dahmun Goudarzi, Anthony Journault, Matthieu Rivain, and François-Xavier Standaert

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: Published elsewhere. Minor revision. COSADE 2018
Contact author(s): dahmun goudarzi @ cryptoexperts com
anthony journault @ uclouvain be
History: 2018-04-03: received
Short URL: https://ia.cr/2018/315
License: CC BY

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}
}