2015
DOI: 10.1007/978-3-319-21476-4_2
|View full text |Cite
|
Sign up to set email alerts
|

Template Attacks vs. Machine Learning Revisited (and the Curse of Dimensionality in Side-Channel Analysis)

Abstract: Abstract. Template attacks and machine learning are two popular approaches to profiled side-channel analysis. In this paper, we aim to contribute to the understanding of their respective strengths and weaknesses, with a particular focus on their curse of dimensionality. For this purpose, we take advantage of a well-controlled simulated experimental setting in order to put forward two important intuitions. First and from a theoretical point of view, the data complexity of template attacks is not sensitive to th… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

3
50
0

Year Published

2018
2018
2021
2021

Publication Types

Select...
4
2
2

Relationship

1
7

Authors

Journals

citations
Cited by 86 publications
(53 citation statements)
references
References 22 publications
3
50
0
Order By: Relevance
“…For these experiments, we can see that the result of machine learning approach is better compared to TA, especially with SVM and RF. This is more or less similar to the observations made in [110] about RF (requiring fewer number of training data with ability to cope with some irrelevant features),…”
Section: Methodssupporting
confidence: 83%
“…For these experiments, we can see that the result of machine learning approach is better compared to TA, especially with SVM and RF. This is more or less similar to the observations made in [110] about RF (requiring fewer number of training data with ability to cope with some irrelevant features),…”
Section: Methodssupporting
confidence: 83%
“…When working with the typical assumption for profiled SCA that the profiling phase is not bounded, the situation actually becomes rather simple if neglecting computational costs. If the attacker is able to acquire an unlimited (or, in real-world very large) amount of traces, the template attack (TA) is proven to be optimal from an information theoretic point of view (see e.g., [1,2]). In that context of unbounded and unrestricted profiling phase, ML techniques seem not needed.…”
Section: Introductionmentioning
confidence: 99%
“…In this paper, we promote efficient approaches exploiting (i) a smaller running time and (ii) less knowledge on the target device compared to the Bayes classifier. Following recent papers in the side-channel community discussing machine learning models, we focus on (learning) models called random forests, template attacks and profiled attacks based on the kernel density estimation method [5], [19], [20], [22]. The main issue of profiled attacks lies in the exploitation of leakages containing a large number of dimensions.…”
Section: Introductionmentioning
confidence: 99%