Paper 2014/412
Efficient Selection of Time Samples for Higher-Order DPA with Projection Pursuits
François Durvaux, François-Xavier Standaert, Nicolas Veyrat-Charvillon, Jean-Baptiste Mairy, and Yves Deville
Abstract
The selection of points-of-interest in leakage traces is a frequently neglected problem in the side-channel literature. However, it can become the bottleneck of practical adversaries/evaluators as the size of the measurement traces increases, especially in the challenging context of masked implementations, where only a combination of multiple shares reveals information in higher-order statistical moments. In this paper, we describe new (black box) tools for efficiently dealing with this problem. The proposed techniques exploit projection pursuits and optimized local search algorithms, work with minimum memory requirements and practical time complexity. We validate them with two case-studies of unprotected and first-order masked implementations in an 8-bit device, the latter one being hard to analyze with previously known methods.
Metadata
- Available format(s)
-
PDF
- Publication info
- Published elsewhere. Minor revision. proceedings of COSADE 2015
- Keywords
- implementations
- Contact author(s)
- fstandae @ uclouvain be
- History
- 2015-03-05: revised
- 2014-06-04: received
- See all versions
- Short URL
- https://ia.cr/2014/412
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2014/412,
author = {François Durvaux and François-Xavier Standaert and Nicolas Veyrat-Charvillon and Jean-Baptiste Mairy and Yves Deville},
title = {Efficient Selection of Time Samples for Higher-Order {DPA} with Projection Pursuits},
howpublished = {Cryptology {ePrint} Archive, Paper 2014/412},
year = {2014},
url = {https://eprint.iacr.org/2014/412}
}
