k-Nearest Neighbors Algorithm in Profiling Power Analysis Attacks
Loading...
Date
2016-06
ORCID
Advisor
Referee
Mark
Journal Title
Journal ISSN
Volume Title
Publisher
Společnost pro radioelektronické inženýrství
Altmetrics
Abstract
Power analysis presents the typical example of successful attacks against trusted cryptographic devices such as RFID (Radio-Frequency IDentifications) and contact smart cards. In recent years, the cryptographic community has explored new approaches in power analysis based on machine learning models such as Support Vector Machine (SVM), RF (Random Forest) and Multi-Layer Perceptron (MLP). In this paper, we made an extensive comparison of machine learning algorithms in the power analysis. For this purpose, we implemented a verification program that always chooses the optimal settings of individual machine learning models in order to obtain the best classification accuracy. In our research, we used three datasets, the first containing the power traces of an unprotected AES (Advanced Encryption Standard) implementation. The second and third datasets are created independently from public available power traces corresponding to a masked AES implementation (DPA Contest v4). The obtained results revealed some interesting facts, namely, an elementary k-NN (k-Nearest Neighbors) algorithm, which has not been commonly used in power analysis yet, shows great application potential in practice.
Description
Citation
Radioengineering. 2016 vol. 25, č. 2, s. 365-382. ISSN 1210-2512
http://www.radioeng.cz/fulltexts/2016/16_02_0365_0382.pdf
http://www.radioeng.cz/fulltexts/2016/16_02_0365_0382.pdf
Document type
Peer-reviewed
Document version
Published version
Date of access to the full text
Language of document
en