The Myth of Generic DPA…and the Magic of Learning
From MaRDI portal
Publication:5404752
Recommendations
- Generality's price. Inescapable deficiencies in machine-learned programs
- Generality's price: Inescapable deficiencies in machine-learned programs
- General perspective on distributionally learnable classes
- Using the doubling dimension to analyze the generalization of learning algorithms
- Algorithmic Learning Theory
- A generalized model of PAC learning and its applicability
- Generic properties of learning systems
- PAC-learning from general examples
Cited in
(16)- How to fool a black box machine learning based side-channel security evaluation
- Generic DPA attacks: curse or blessing?
- Profiling DPA: efficacy and efficiency trade-offs
- Evaluation and improvement of generic-emulating DPA attacks
- Bridging the gap: advanced tools for side-channel leakage estimation beyond Gaussian templates and histograms
- Not optimal but efficient: a distinguisher based on the Kruskal-Wallis test
- Revisiting mutual information analysis: multidimensionality, neural estimation and optimality proofs
- Masking tables -- an underestimated security risk
- Fake it till you make it: data augmentation using generative adversarial networks for all the crypto you need on small devices
- A theoretical study of Kolmogorov-Smirnov distinguishers
- On the optimality and practicability of mutual information analysis in some scenarios
- Ridge-based profiled differential power analysis
- Categorising and comparing cluster-based DPA distinguishers
- \textsf{Scatter}: a missing case?
- Differential power analysis of a McEliece cryptosystem
- A novel completeness test for leakage models and its application to side channel attacks and responsibly engineered simulators
This page was built for publication: The Myth of Generic DPA…and the Magic of Learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5404752)
