Pages that link to "Item:Q4899715"
From MaRDI portal
The following pages link to Higher-Order Masking Schemes for S-Boxes (Q4899715):
Displaying 25 items.
- Correlation power analysis and higher-order masking implementation of WAGE (Q832394) (← links)
- Strong 8-bit sboxes with efficient masking in hardware (Q1695970) (← links)
- Unifying leakage models: from probing attacks to noisy leakage (Q1715856) (← links)
- Statistical properties of side-channel and fault injection attacks using coding theory (Q1749798) (← links)
- The multiplicative complexity of 6-variable Boolean functions (Q1755188) (← links)
- Making masking security proofs concrete (or how to evaluate the security of any leaking device), extended version (Q2010587) (← links)
- Multiplicative complexity of bijective \(4\times 4\) \(S\)-boxes (Q2016430) (← links)
- Tornado: automatic generation of probing-secure masked bitsliced implementations (Q2055659) (← links)
- A number theoretic view on binary shift registers (Q2088954) (← links)
- Secure wire shuffling in the probing model (Q2128997) (← links)
- Upper bounds on the multiplicative complexity of symmetric Boolean functions (Q2179499) (← links)
- Decomposition of permutations in a finite field (Q2632833) (← links)
- Polynomial Evaluation and Side Channel Analysis (Q2803637) (← links)
- Higher-Order Side Channel Security and Mask Refreshing (Q2946888) (← links)
- Higher-Order Glitch Resistant Implementation of the PRESENT S-Box (Q2947102) (← links)
- Verified Proofs of Higher-Order Masking (Q2948340) (← links)
- MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity (Q2958119) (← links)
- Secure Multiplication for Bitslice Higher-Order Masking: Optimisation and Comparison (Q3297548) (← links)
- Threshold Implementation in Software (Q3297560) (← links)
- Algebraic Decomposition for Probing Security (Q3457137) (← links)
- Constructing $8$-bit permutations, $8$-bit involutions and $8$-bit orthomorphisms with almost optimal cryptographic parameters (Q5071475) (← links)
- How Fast Can Higher-Order Masking Be in Software? (Q5738890) (← links)
- On decompositions of permutation polynomials into quadratic and cubic power permutations (Q6159437) (← links)
- Faster Secure Multi-party Computation of AES and DES Using Lookup Tables (Q6487205) (← links)
- Automated verification of correctness for masked arithmetic programs (Q6535686) (← links)
