Paper 2018/328

Improved High-Order Conversion From Boolean to Arithmetic Masking

Luk Bettale, Jean-Sebastien Coron, and Rina Zeitoun

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.

Metadata
Available format(s)
PDF
Category
Implementation
Publication info
Published by the IACR in TCHES 2018
Keywords
Side-channel countermeasurehigh-order maskingBoolean to arithmetic conversionISW security proof
Contact author(s)
jscoron @ gmail com
History
2018-04-09: received
Short URL
https://ia.cr/2018/328
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2018/328,
      author = {Luk Bettale and Jean-Sebastien Coron and Rina Zeitoun},
      title = {Improved High-Order Conversion From Boolean to Arithmetic Masking},
      howpublished = {Cryptology ePrint Archive, Paper 2018/328},
      year = {2018},
      note = {\url{https://eprint.iacr.org/2018/328}},
      url = {https://eprint.iacr.org/2018/328}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.