This repo is created for presenting optimal linear codes in IPM, SSS-based masking, etc. Note that the irreducible polynomial is g(X) = X^8 + X^4 + X^3 + X +1, which is the one used in AES.

We present a unified framework for quantifying the side-channel resistance of the Generalized Code-based Masking (GCM).