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

Gilles Barthe, 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.

Available format(s)
Publication info
Preprint. MINOR revision.
Keywords
Contact author(s)
fdupress @ gmail com
History
Short URL
https://ia.cr/2017/1053

CC BY

BibTeX

@misc{cryptoeprint:2017/1053,
author = {Gilles Barthe and François Dupressoir and Benjamin Grégoire},
title = {A Note on 'Further Improving Efficiency of Higher-Order Masking Scheme by Decreasing Randomness Complexity'},
howpublished = {Cryptology ePrint Archive, Paper 2017/1053},
year = {2017},
note = {\url{https://eprint.iacr.org/2017/1053}},
url = {https://eprint.iacr.org/2017/1053}
}

Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.