Welcome to the resource topic for 2017/1053
Title:
A Note on ‘Further Improving Efficiency of Higher-Order Masking Scheme by Decreasing Randomness Complexity’
Authors: Gilles Barthe, François Dupressoir, 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.
ePrint: https://eprint.iacr.org/2017/1053
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .