Cryptology ePrint Archive: Report 2018/328

Improved High-Order Conversion From Boolean to Arithmetic Masking

Luk Bettale and 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.

Category / Keywords: implementation / Side-channel countermeasure, high-order masking, Boolean to arithmetic conversion, ISW security proof

Original Publication (in the same form): IACR-CHES-2018

Date: received 9 Apr 2018

Contact author: jscoron at gmail com

Available format(s): PDF | BibTeX Citation

Version: 20180409:121741 (All versions of this report)

Short URL: ia.cr/2018/328


[ Cryptology ePrint archive ]