Constructing optimal linear codes for code-based masking schemes of higher-orders
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1682693 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 1559526 (Why is no real title available?)
- scientific article; zbMATH DE number 1418307 (Why is no real title available?)
- Advances in Cryptology - CRYPTO 2003
- Error control coding. Fundamentals and applications
- Formal security proofs via Doeblin coefficients: optimal side-channel factorization from noisy leakage to random probing
- Good is not good enough. Deriving optimal distinguishers from communication theory
- Inner product masking revisited
- Masking against Side-Channel Attacks: A Formal Security Proof
- Masks will fall off. Higher-order optimal distinguishers
- Mathematical foundations for side-channel analysis of cryptographic systems
- On Linear Complementary Pairs of Codes
- On the equivalence of generalized concatenated codes and generalized error location codes
- Protecting AES with Shamir's secret sharing scheme
- Statistical properties of side-channel and fault injection attacks using coding theory
- Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems
- Towards sound approaches to counteract power-analysis attacks
This page was built for publication: Constructing optimal linear codes for code-based masking schemes of higher-orders
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6835004)