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 specialized 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.
CITATION STYLE
Durvaux, F., Standaert, F. X., Veyrat-Charvillon, N., Mairy, J. B., & Deville, Y. (2015). Efficient selection of time samples for higher-order DPA with projection pursuits. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9064, pp. 34–50). Springer Verlag. https://doi.org/10.1007/978-3-319-21476-4_3
Mendeley helps you to discover research relevant for your work.