Correlated Extra-Reductions Defeat Blinded Regular Exponentiation - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2016

Correlated Extra-Reductions Defeat Blinded Regular Exponentiation

Résumé

Walter & Thomson (CT-RSA '01) and Schindler (PKC '02) have shown that extra-reductions allow to break RSA-CRT even with message blinding. Indeed, the extra-reduction probability depends on the type of operation (square, multiply, or multiply with a constant). Regular exponentiation schemes can be regarded as protections since the operation sequence does not depend on the secret. In this article, we show that there exists a strong negative correlation between extra-reductions of two consecutive operations, provided that the first feeds the second. This allows to mount successful attacks even against blinded asymmetrical computations with a regular exponentiation algorithm, such as Square-and-Multiply Always or Montgomery Ladder. We investigate various attack strategies depending on the context - known or unknown modulus, known or unknown extra-reduction detection probability, etc.-and implement them on two devices: a single core ARM Cortex-M4 and a dual core ARM Cortex M0-M4.
Fichier principal
Vignette du fichier
201608dugardinguilleydangernajmrioul.pdf.pdf (1.05 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03750287 , version 1 (12-08-2022)

Identifiants

Citer

Margaux Dugardin, Sylvain Guilley, Jean-Luc Danger, Zakaria Najm, Olivier Rioul. Correlated Extra-Reductions Defeat Blinded Regular Exponentiation. 18th International Conference on Cryptographic Hardware and Embedded Systems (CHES 2016), Aug 2016, Santa Barbara, CA, United States. pp.3-22, ⟨10.1007/978-3-662-53140-2⟩. ⟨hal-03750287⟩
55 Consultations
31 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More