Cryptology ePrint Archive: Report 2021/909

Efficiency through Diversity in Ensemble Models applied to Side-Channel Attacks – A Case Study on Public-Key Algorithms –

Gabriel Zaid and Lilian Bossuet and Amaury Habrard and Alexandre Venelli

Abstract: Deep Learning based Side-Channel Attacks (DL-SCA) are considered as fundamental threats against secure cryptographic implementations. Side-channel attacks aim to recover a secret key using the least number of leakage traces. In DL-SCA, this often translates in having a model with the highest possible accuracy. Increasing an attack’s accuracy is particularly important when an attacker targets public-key cryptographic implementations where the recovery of each secret key bits is directly related to the model’s accuracy. Commonly used in the deep learning field, ensemble models are a well suited method that combine the predictions of multiple models to increase the ensemble accuracy by reducing the correlation between their errors. Linked to this correlation, the diversity is considered as an indicator of the ensemble model performance. In this paper, we propose a new loss, namely Ensembling Loss (EL), that generates an ensemble model which increases the diversity between the members. Based on the mutual information between the ensemble model and its related label, we theoretically demonstrate how the ensemble members interact during the training process. We also study how an attack’s accuracy gain translates to a drastic reduction of the remaining time complexity of a side-channel attacks through multiple scenarios on public-key implementations. Finally, we experimentally evaluate the benefits of our new learning metric on RSA and ECC secure implementations. The Ensembling Loss increases by up to $6.8\%$ the performance of the ensemble model while the remaining brute-force is reduced by up to $2^{22}$ operations depending on the attack scenario.

Category / Keywords: public-key cryptography / Side-Channel Attacks, Deep Learning, Ensemble Learning, Diversity, Mutual Information, Public-Key Algorithms

Original Publication (in the same form): IACR-CHES-2021

Date: received 4 Jul 2021

Contact author: gabriel zaid at univ-st-etienne fr

Available format(s): PDF | BibTeX Citation

Version: 20210705:185422 (All versions of this report)

Short URL: ia.cr/2021/909


[ Cryptology ePrint archive ]