Efficient algorithmic evaluation of correlation power analysis: Key distinguisher based on the correlation trace derivative

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F19%3A00332371" target="_blank" >RIV/68407700:21240/19:00332371 - isvavai.cz</a>

Výsledek na webu

<a href="http://hdl.handle.net/10467/86911" target="_blank" >http://hdl.handle.net/10467/86911</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.micpro.2019.102858" target="_blank" >10.1016/j.micpro.2019.102858</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Efficient algorithmic evaluation of correlation power analysis: Key distinguisher based on the correlation trace derivative

Popis výsledku v původním jazyce

Correlation power analysis (CPA) is one of the most common side-channel attacks today, posing a threat to many modern ciphers, including AES. In the final step of this attack, the cipher key is usually extracted by the attacker by visually examining the correlation traces for each key guess. The naïve way to extract the correct key algorithmically is selecting the key guess with the maximum Pearson correlation coefficient. We propose another key distinguisher based on a significant change in the correlation trace rather than on the absolute value of the coefficient. Our approach performs better than the standard maximization, especially in the noisy environment, and it allows to significantly reduce the number of acquired power traces necessary to successfully mount an attack in noisy environment, and in some cases make the attack even feasible.

Název v anglickém jazyce

Efficient algorithmic evaluation of correlation power analysis: Key distinguisher based on the correlation trace derivative

Popis výsledku anglicky

Correlation power analysis (CPA) is one of the most common side-channel attacks today, posing a threat to many modern ciphers, including AES. In the final step of this attack, the cipher key is usually extracted by the attacker by visually examining the correlation traces for each key guess. The naïve way to extract the correct key algorithmically is selecting the key guess with the maximum Pearson correlation coefficient. We propose another key distinguisher based on a significant change in the correlation trace rather than on the absolute value of the coefficient. Our approach performs better than the standard maximization, especially in the noisy environment, and it allows to significantly reduce the number of acquired power traces necessary to successfully mount an attack in noisy environment, and in some cases make the attack even feasible.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

20206 - Computer hardware and architecture

Projekt

<a href="/cs/project/GA16-05179S" target="_blank" >GA16-05179S: Výzkum vztahů a společných vlastností spolehlivých a bezpečných architektur založených na programovatelných obvodech</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2019

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Microprocessors and Microsystems

ISSN

0141-9331

e-ISSN

1872-9436

Svazek periodika

2019

Číslo periodika v rámci svazku

71

Stát vydavatele periodika

NL - Nizozemsko

Počet stran výsledku

8

Strana od-do

1-8

Kód UT WoS článku

000500052000034

EID výsledku v databázi Scopus

2-s2.0-85070191187