Improved High-Order Conversion From Boolean to Arithmetic Masking

Authors

  • Luk Bettale IDEMIA, France
  • Jean-Sébastien Coron University of Luxembourg
  • Rina Zeitoun IDEMIA, France

DOI:

https://doi.org/10.13154/tches.v2018.i2.22-45

Keywords:

Side-channel countermeasure, high-order masking, Boolean to arithmetic conversion, ISW security proof

Abstract

Masking is a very common countermeasure against side channel attacks. When combining Boolean and arithmetic masking, one must be able to convert between the two types of masking, and the conversion algorithm itself must be secure against side-channel attacks. An efficient high-order Boolean to arithmetic conversion scheme was recently described at CHES 2017, with complexity independent of the register size. In this paper we describe a simplified variant with fewer mask refreshing, and still with a proof of security in the ISW probing model. In practical implementations, our variant is roughly 25% faster.

Downloads

Published

2018-05-08

Issue

Volume 2018, Issue 2

Section

Articles

License

Copyright (c) 2018 Luk Bettale, Jean-Sébastien Coron, Rina Zeitoun

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

How to Cite

Improved High-Order Conversion From Boolean to Arithmetic Masking. (2018). IACR Transactions on Cryptographic Hardware and Embedded Systems, 2018(2), 22-45. https://doi.org/10.13154/tches.v2018.i2.22-45