Google Scholar: citations
Profiling attack against rsa key generation based on a euclidean algorithm
de la Fé, Sadiel (Universitat Autònoma de Barcelona. Departament de Microelectrònica i Sistemes Electrònics)
Park, Han-Byeol (Kookmin University. Department of Financial Information Security)
Sim, Bo-Yeon (Kookmin University. Department of Mathematics)
Han, Dong-Guk (Kookmin University. Department of Mathematics and Financial Information Security)
Ferrer, Carles (Universitat Autònoma de Barcelona. Departament de Microelectrònica i Sistemes Electrònics)

Date: 2021
Abstract: A profiling attack is a powerful variant among the noninvasive side channel attacks. In this work, we target RSA key generation relying on the binary version of the extended Euclidean algorithm for modular inverse and GCD computations. To date, this algorithm has only been exploited by simple power analysis; therefore, the countermeasures described in the literature are focused on mitigating only this kind of attack. We demonstrate that one of those countermeasures is not effective in preventing profiling attacks. The feasibility of our approach relies on the extraction of several leakage vectors from a single power trace. Moreover, because there are known relationships between the secrets and the public modulo in RSA, the uncertainty in some of the guessed secrets can be reduced by simple tests. This increases the effectiveness of the proposed attack.
Rights: Aquest document està subjecte a una llicència d'ús Creative Commons. Es permet la reproducció total o parcial, la distribució, la comunicació pública de l'obra i la creació d'obres derivades, fins i tot amb finalitats comercials, sempre i quan es reconegui l'autoria de l'obra original. Creative Commons
Language: Anglès
Document: Article ; recerca ; Versió publicada
Subject: Euclidean algorithm ; GCD ; RSA key generation ; Side channel attack ; Profiling attack ; Machine learning-based attack
Published in: Information, Vol. 12, Issue 11 (November 2021) , art. 462, ISSN 2078-2489

DOI: 10.3390/info12110462


12 p, 528.4 KB

The record appears in these collections:
Articles > Research articles
Articles > Published articles

 Record created 2022-02-14, last modified 2024-11-06



   Favorit i Compartir