# Towards Finding Best Linear Codes for Side-Channel Protections

1 COMNUM - Communications Numériques
LTCI - Laboratoire Traitement et Communication de l'Information
5 SSH - Secure and Safe Hardware
LTCI - Laboratoire Traitement et Communication de l'Information
Abstract : Side-channel attacks aim at extracting secret keys from cryptographic devices. Randomly masking the implementation is a provable way to protect the secrets against this threat. Recently, various masking schemes have converged to the code-based masking'' philosophy. In code-based masking, different codes allow for different levels of side-channel security. In practice, for a given leakage function, it is important to select the code which enables the best resistance, i.e., which forces the attacker to capture and analyze the largest number of side-channel traces. This paper is a first attempt to address the constructive selection of the optimal codes in the context of side-channel countermeasures, in particular for code-based masking when the device leaks information in the Hamming weight leakage model. We show that the problem is related to the weight enumeration of the extended dual of the masking code. We first present mathematical tools to study those weight enumeration polynomials, and then provide an efficient method to search for good codes, based on a lexicographic sorting of the weight enumeration polynomial from lowest to highest degrees.
Document type :
Conference papers
Domain :

https://hal.telecom-paris.fr/hal-03328130
Contributor : Olivier Rioul Connect in order to contact the contributor
Submitted on : Wednesday, September 15, 2021 - 9:48:36 AM
Last modification on : Tuesday, October 19, 2021 - 11:16:45 AM

### File

202109chengliuguilleyrioul.pdf
Files produced by the author(s)

### Identifiers

• HAL Id : hal-03328130, version 1

### Citation

Wei Cheng, Yi Liu, Sylvain Guilley, Olivier Rioul. Towards Finding Best Linear Codes for Side-Channel Protections. 10th International Workshop on Security Proofs for Embedded Systems (PROOFS'2021), Sep 2021, Beijing, China. ⟨hal-03328130⟩

Record views