Pages that link to "Item:Q2946888"
From MaRDI portal
The following pages link to Higher-Order Side Channel Security and Mask Refreshing (Q2946888):
Displaying 27 items.
- Correlation power analysis and higher-order masking implementation of WAGE (Q832394) (← links)
- White-box cryptography: don't forget about grey-box attacks (Q2010584) (← links)
- Making masking security proofs concrete (or how to evaluate the security of any leaking device), extended version (Q2010587) (← links)
- Tornado: automatic generation of probing-secure masked bitsliced implementations (Q2055659) (← links)
- On the power of expansion: more efficient constructions in the random probing model (Q2056735) (← links)
- Random probing security: verification, composition, expansion and new constructions (Q2096491) (← links)
- Towards tight random probing security (Q2128995) (← links)
- Cryptanalysis of masked ciphers: a not so random idea (Q2692369) (← links)
- Higher-Order Masking in Practice: A Vector Implementation of Masked AES for ARM NEON (Q2790039) (← links)
- Polynomial Evaluation and Side Channel Analysis (Q2803637) (← links)
- Affine Masking against Higher-Order Side Channel Analysis (Q3084260) (← links)
- Reducing Randomness Complexity of Mask Refreshing Algorithm (Q3297482) (← links)
- Secure Multiplication for Bitslice Higher-Order Masking: Optimisation and Comparison (Q3297548) (← links)
- Vectorizing Higher-Order Masking (Q3297549) (← links)
- Compositional Synthesis of Leakage Resilient Programs (Q3304821) (← links)
- Detecting Flawed Masking Schemes with Leakage Detection Tests (Q4639478) (← links)
- Masking against Side-Channel Attacks: A Formal Security Proof (Q4924408) (← links)
- Маскирование ГОСТ 28147-89 для защиты от атак по побочным каналам (Q5152388) (← links)
- How Fast Can Higher-Order Masking Be in Software? (Q5738890) (← links)
- Unconditionally secure computation against low-complexity leakage (Q5918097) (← links)
- Correction to: ``Unconditionally secure computation against low-complexity leakage'' (Q5925544) (← links)
- Dynamic random probing expansion with quasi linear asymptotic complexity (Q6157515) (← links)
- Formal verification of arithmetic masking in hardware and software (Q6535070) (← links)
- Automated verification of correctness for masked arithmetic programs (Q6535686) (← links)
- Exploiting algebraic structures in probing security (Q6604876) (← links)
- Mask compression: high-order masking on memory-constrained devices (Q6620034) (← links)
- Leakage-tolerant circuits (Q6637525) (← links)