%0 Journal Article %T Optimizing Inner Product Masking Scheme by A Coding Theory Approach %+ Laboratoire Traitement et Communication de l'Information (LTCI) %+ Secure-IC S.A.S %+ Département d'informatique - ENS Paris (DI-ENS) %+ Université Paris 8 Vincennes-Saint-Denis - Département de Mathématiques %+ Laboratoire Analyse, Géométrie et Applications (LAGA) %A Cheng, Wei %A Guilley, Sylvain %A Carlet, Claude %A Mesnager, Sihem %A Danger, Jean-Luc %Z TeamPlay : https://teamplay-h2020.eu/ , a project from European Union's Horizon 2020 research and innovation program, under grand agreement No 779882.Work supported by National Natural Science Foundation of China (No. 61632020) and the scholarship from China Scholarship Council (CSC) under the grant No 201809110144. %< avec comité de lecture %@ 1556-6013 %J IEEE Transactions on Information Forensics and Security %I Institute of Electrical and Electronics Engineers %V 16 %P 220-235 %8 2020 %D 2020 %R 10.1109/TIFS.2020.3009609 %K Side-Channel Analysis %K Countermeasure %K Inner Product Masking %K Coding Theory %K Optimal Linear Code %Z Computer Science [cs]/Cryptography and Security [cs.CR]Journal articles %X Masking is one of the most popular countermeasures to protect cryptographic implementations against side-channel analysis since it is provably secure and can be deployed at the algorithm level. To strengthen the original Boolean masking scheme, several works have suggested using schemes with high algebraic complexity. The Inner Product Masking (IPM) is one of those. In this paper, we propose a unified framework to quantitatively assess the side-channel security of the IPM in a coding-theoretic approach. Specifically, starting from the expression of IPM in a coded form, we use two defining parameters of the code to characterize its side-channel resistance. In order to validate the framework, we then connect it to two leakage metrics (namely signal-to-noise ratio and mutual information, from an information-theoretic aspect) and one typical attack metric (success rate, from a practical aspect) to build a firm foundation for our framework. As an application, our results provide ultimate explanations on the observations made by Balasch et al. at EUROCRYPT'15 and at ASIACRYPT'17, Wang et al. at CARDIS'16 and Poussier et al. at CARDIS'17 regarding the parameter effects in IPM, like higher security order in bounded moment model. Furthermore, we show how to systematically choose optimal codes (in the sense of a concrete security level) to optimize IPM by using this framework. Eventually, we present a simple but effective algorithm for choosing optimal codes for IPM, which is of special interest for designers when selecting optimal parameters for IPM. %G English %2 https://cnrs.hal.science/hal-02919657/document %2 https://cnrs.hal.science/hal-02919657/file/Optimizing_ipm_tifs.pdf %L hal-02919657 %U https://cnrs.hal.science/hal-02919657 %~ INSTITUT-TELECOM %~ UNIV-PARIS13 %~ ENS-PARIS %~ UNIV-PARIS8 %~ CNRS %~ INRIA %~ LAGA %~ TELECOM-PARISTECH %~ PARISTECH %~ OPENAIRE %~ PSL %~ USPC %~ INRIA-AUT %~ LTCI %~ COMELEC %~ INFRES %~ MC2 %~ SSH %~ IP_PARIS %~ UNIV-PARIS-LUMIERES %~ INSTITUTS-TELECOM %~ SORBONNE-PARIS-NORD %~ TEST-HALCNRS %~ ENS-PSL %~ UNIV-PARIS8-OA %~ C2