We present here the exhaustive study of optimal linear codes for Inner Product Masking (IPM).
-
Updated
Mar 22, 2021 - Jupyter Notebook
#
code-based-masking
Here are 3 public repositories matching this topic...
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.
inner-product-masking
optimal-linear-codes
code-based-masking
side-channel-analysis
direct-sum-masking
sss-based-masking
-
Updated
Aug 3, 2022 - MATLAB
We present a unified framework for quantifying the side-channel resistance of the Generalized Code-based Masking (GCM).
shamir-secret-sharing
side-channel-attacks
inner-product-masking
code-based-masking
higher-order-masking
direct-sum-masking
leakage-squeezing
polynomial-masking
-
Updated
Jun 4, 2021 - Jupyter Notebook
Improve this page
Add a description, image, and links to the code-based-masking topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the code-based-masking topic, visit your repo's landing page and select "manage topics."