z-logo
open-access-imgOpen Access
Template Attacks with Partial Profiles and Dirichlet Priors
Author(s) -
Éloi de Chérisey,
Sylvain Guilley,
Olivier Rioul,
Darshana Jayasinghe
Publication year - 2016
Publication title -
hal (le centre pour la communication scientifique directe)
Language(s) - English
Resource type - Conference proceedings
DOI - 10.1145/2948618.2948625
Subject(s) - workaround , computer science , prior probability , profiling (computer programming) , a priori and a posteriori , side channel attack , algorithm , data mining , theoretical computer science , cryptography , artificial intelligence , bayesian probability , philosophy , epistemology , programming language , operating system
In order to retrieve the secret key in a side-channel attack, the attacker computes distinguisher values using all the available data. A profiling stage is very useful to provide some a priori information about the leakage model. However, profiling is essentially empirical and may not be exhaustive. Therefore, during the attack, the attacker may come up on previously unseen data, which can be troublesome. A lazy workaround is to ignore all such novel observations altogether. In this paper, we show that this is not optimal and can be avoided. Our proposed techniques eventually improve the performance of classical information-theoretic distinguishers in terms of success rate.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom