Welcome to the resource topic for 2023/406
Title:
Quasi-linear masking to protect against both SCA and FIA
Authors: Claude Carlet, Abderrahman Daif, Sylvain Guilley, Cédric Tavernier
Abstract:The implementation of cryptographic algorithms must be protected against physical attacks. Side-channel and fault injection analyses are two prominent such implem-entation-level attacks. Protections against either do exist; they are characterized by security orders: the higher the order, the more difficult the attack.
In this paper, we leverage fast discrete Fourier transform to reduce the complexity of high-order masking, and extend it to allow for fault detection and/or correction. The security paradigm is that of code-based masking. Coding theory is amenable both to mix the information and masking material at a prescribed order, and to detect and/or correct errors purposely injected by an attacker.
For the first time, we show that quasi-linear masking (pioneered by Goudarzi, Joux and Rivain at ASIACRYPT 2018) can be achieved alongside with cost amortisation. This technique consists in masking several symbols/bytes with the same masking material, therefore improving the efficiency of the masking. Similarly, it allows to optimize the detection capability of codes as linear codes are all the more efficient as the information to protect is longer. Namely, we prove mathematically that our scheme features side-channel security order of d+1-t, detects d faults and corrects \lfloor(d-1)/2\rfloor faults, where 2d+1 is the encoding length and t is the information size (t\geq1). Applied to AES, one can get side-channel protection of order d=7 when masking one column/line (t=4 bytes) at once.
In addition to the theory, that makes use of the Frobenius Additive Fast Fourier Transform, we show performance results, both in software and hardware.
ePrint: https://eprint.iacr.org/2023/406
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 .