Detecting Faults in Inner-Product Masking Scheme - IPM-FD: IPM with Fault Detection
-
Updated
Aug 12, 2019 - C
Detecting Faults in Inner-Product Masking Scheme - IPM-FD: IPM with Fault Detection
We present here the exhaustive study of optimal linear codes for Inner Product Masking (IPM).
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).
Add a description, image, and links to the inner-product-masking topic page so that developers can more easily learn about it.
To associate your repository with the inner-product-masking topic, visit your repo's landing page and select "manage topics."