Pages that link to "Item:Q3457137"
From MaRDI portal
The following pages link to Algebraic Decomposition for Probing Security (Q3457137):
Displaying 13 items.
- Linear decomposition method in analyzing hidden information protocols on algebraic platforms (Q498303) (← links)
- Uniform first-order threshold implementations (Q1698616) (← links)
- Statistical properties of side-channel and fault injection attacks using coding theory (Q1749798) (← links)
- Tornado: automatic generation of probing-secure masked bitsliced implementations (Q2055659) (← links)
- Monomial evaluation of polynomial functions protected by threshold implementations -- with an illustration on AES -- extended version (Q2120989) (← links)
- Efficient generation of quadratic cyclotomic classes for shortest quadratic decompositions of polynomials (Q2121013) (← links)
- Decomposition of permutations in a finite field (Q2632833) (← links)
- Polynomial Evaluation and Side Channel Analysis (Q2803637) (← links)
- Algorithmic Tamper-Proof Security under Probing Attacks (Q3588333) (← links)
- (Q5113481) (← links)
- How Fast Can Higher-Order Masking Be in Software? (Q5738890) (← links)
- Dynamic random probing expansion with quasi linear asymptotic complexity (Q6157515) (← links)
- On decompositions of permutation polynomials into quadratic and cubic power permutations (Q6159437) (← links)