Cryptology ePrint Archive: Report 2017/1053

A Note on 'Further Improving Efficiency of Higher-Order Masking Scheme by Decreasing Randomness Complexity'

Gilles Barthe and François Dupressoir and Benjamin Grégoire

Abstract: Zhang, Qiu and Zhou propose two optimised masked algorithms for computing functions of the form $x \mapsto x \cdot \ell(x)$ for any linear function $\ell$. They claim security properties.

We disprove their first claim by exhibiting a first order flaw that is present in their first proposed algorithm scheme at all orders.

We put their second claim into question by showing that their proposed algorithm, as published, is not well-defined at all orders, making use of variables before defining them. We then also exhibit a counterexample at order 2, that we believe generalises to all even orders.

Category / Keywords: higher-order masking, probing security

Date: received 28 Oct 2017

Contact author: fdupress at gmail com

Available format(s): PDF | BibTeX Citation

Version: 20171031:151956 (All versions of this report)

Short URL: ia.cr/2017/1053

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]