International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

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
Download:
DOI: 10.13154/tches.v2018.i2.22-45
URL: https://tches.iacr.org/index.php/TCHES/article/view/873
Search ePrint
Search Google
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.
Video from TCHES 2018
BibTeX
@article{tches-2018-28968,
  title={Improved High-Order Conversion From Boolean to Arithmetic Masking},
  journal={Transactions on Cryptographic Hardware and Embedded Systems},
  publisher={Ruhr-Universität Bochum},
  volume={2018, Issue 2},
  pages={22-45},
  url={https://tches.iacr.org/index.php/TCHES/article/view/873},
  doi={10.13154/tches.v2018.i2.22-45},
  author={Luk Bettale and Jean-Sébastien Coron and Rina Zeitoun},
  year=2018
}