Paper 2017/252

High-Order Conversion From Boolean to Arithmetic Masking

Jean-Sebastien Coron

Abstract

Masking with random values is an effective countermeasure against side-channel attacks. For cryptographic algorithms combining arithmetic and Boolean masking, it is necessary to switch from arithmetic to Boolean masking and vice versa. Following a recent approach by Hutter and Tunstall, we describe a high-order Boolean to arithmetic conversion algorithm whose complexity is independent of the register size k. Our new algorithm is proven secure in the Ishai, Sahai and Wagner (ISW) framework for private circuits. In practice, for small orders, our new countermeasure is one order of magnitude faster than previous work. We also describe a 3rd-order attack against the 3rd-order Hutter-Tunstall algorithm, and a constant, 4th-order attack against the t-th order Hutter-Tunstall algorithms, for any t>=4.

Metadata
Available format(s)
PDF
Category
Secret-key cryptography
Publication info
A minor revision of an IACR publication in CHES 2017
Keywords
Side-channel attacks and countermeasuresboolean and arithmetic maskingISW probing model.
Contact author(s)
jean-sebastien coron @ uni lu
History
2017-07-28: last of 3 revisions
2017-03-20: received
See all versions
Short URL
https://ia.cr/2017/252
License
Creative Commons Attribution
CC BY

BibTeX

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