You are looking at a specific version 20210224:145533 of this paper. See the latest version.

Paper 2021/197

Gambling for Success: The Lottery Ticket Hypothesis in Deep Learning-based SCA

Guilherme Perin and Lichao Wu and Stjepan Picek

Abstract

Deep learning-based side-channel analysis (SCA) became the de facto standard in the profiling SCA. Still, this does not mean it is trivial to find neural networks that perform well for any setting. Based on the developed neural network architectures, we can distinguish between small neural networks that are easier to tune and less prone to overfitting but can have insufficient capacity to model the data. On the other hand, large neural networks would have sufficient capacity but can overfit and are more difficult to tune. This always brings an interesting trade-off between simplicity and performance. This paper proposes using a pruning strategy and recently proposed Lottery Ticket Hypothesis to improve the deep learning-based SCA. We demonstrate that we can find smaller neural networks that perform on the level of larger networks, where we manage to reduce the number of weights by more than 90% on average. Additionally, we show that pruning can help prevent overfitting and the effects of imbalanced data, reaching top attack performance for small networks when larger networks do not manage to break the target at all.

Metadata
Available format(s)
PDF
Category
Applications
Publication info
Preprint. MINOR revision.
Keywords
Side-channel AnalysisDeep learningLottery Ticket HypothesisPruning
Contact author(s)
guilhermeperin7 @ gmail com
L Wu-4 @ tudelft nl
picek stjepan @ gmail com
History
2021-11-17: last of 2 revisions
2021-02-24: received
See all versions
Short URL
https://ia.cr/2021/197
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.