Anzeige
Erschienen in:
2014 | OriginalPaper | Buchkapitel
Higher Order Masking of Look-Up Tables
verfasst von : Jean-Sébastien Coron
Erschienen in: Advances in Cryptology – EUROCRYPT 2014
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
We describe a new algorithm for masking look-up tables of block-ciphers at any order, as a countermeasure against side-channel attacks. Our technique is a generalization of the classical randomized table countermeasure against first-order attacks. We prove the security of our new algorithm against
t
-th order attacks in the usual Ishai-Sahai-Wagner model from Crypto 2003; we also improve the bound on the number of shares from
n
≥ 4
t
+ 1 to
n
≥ 2
t
+ 1 for an adversary who can adaptively move its probes between successive executions.
Our algorithm has the same time complexity
$\mathcal{O}$
(
n
2
) as the Rivain-Prouff algorithm for AES, and its extension by Carlet
et al.
to any look-up table. In practice for AES our algorithm is less efficient than Rivain-Prouff, which can take advantage of the special algebraic structure of the AES Sbox; however for DES our algorithm performs slightly better.