Simpler and more efficient rank estimation for side-channel security assessment
From MaRDI portal
Recommendations
- Fast analytical rank estimation
- Poly-logarithmic side channel rank estimation via exponential sampling
- Characterisation and estimation of the key rank distribution in the context of side channel evaluations
- Security evaluations beyond computing power. How to analyze side-channel attacks you cannot mount?
- Counting Keys in Parallel After a Side Channel Attack
Cited in
(15)- Simple key enumeration (and rank estimation) using histograms: an integrated approach
- Making masking security proofs concrete (or how to evaluate the security of any leaking device), extended version
- On the worst-case side-channel security of ECC point randomization in embedded devices
- Two sides of the same coin: counting and enumerating keys post side-channel attacks revisited
- Poly-logarithmic side channel rank estimation via exponential sampling
- Characterisation and estimation of the key rank distribution in the context of side channel evaluations
- A Bounded-Space Near-Optimal Key Enumeration Algorithm for Multi-subkey Side-Channel Attacks
- Score-Based vs. Probability-Based Enumeration – A Cautionary Note
- Security evaluations beyond computing power. How to analyze side-channel attacks you cannot mount?
- Differential bias attack for block cipher under randomized leakage with key enumeration
- Practical leverage-based sampling for low-rank tensor decomposition
- Back to Massey: impressively fast, scalable and tight security evaluation tools
- How to Estimate the Success Rate of Higher-Order Side-Channel Attacks
- Fast analytical rank estimation
- On recovering block cipher secret keys in the cold boot attack setting
This page was built for publication: Simpler and more efficient rank estimation for side-channel security assessment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2946939)
