A Hole in the Ladder: Interleaved Variables in Iterative Conditional Branching - INRIA - Institut National de Recherche en Informatique et en Automatique Accéder directement au contenu
Communication Dans Un Congrès Année : 2020

A Hole in the Ladder: Interleaved Variables in Iterative Conditional Branching

Résumé

The modular exponentiation is crucial to the RSA cryptographic protocol, and variants inspired by the Montgomery ladder have been studied to provide more secure algorithms. In this paper, we abstract away the iterative conditional branching used in the Montgomery ladder, and formalize systems of equations necessary to obtain what we call the semi-interleaved and fully-interleaved ladder properties. In particular, we design fault-injection attacks able to obtain bits of the secret against semi-interleaved ladders, including the Montgomery ladder, but not against fully-interleaved ladders that are more secure. We also apply these equations to extend the Montgomery ladder for both the semi-and fully-interleaved cases, thus proposing novel and more secure algorithms to compute the modular exponentiation.
Fichier principal
Vignette du fichier
ARITH2020.pdf (566.16 Ko) Télécharger le fichier
Origine : Accord explicite pour ce dépôt
Loading...

Dates et versions

hal-02889212 , version 1 (03-07-2020)

Identifiants

Citer

Yoann Marquer, Tania Richmond. A Hole in the Ladder: Interleaved Variables in Iterative Conditional Branching. ARITH 2020 - 27th IEEE Symposium on Computer Arithmetic, Jun 2020, Portland, Oregon, USA, United States. pp.56-63, ⟨10.1109/ARITH48897.2020.00017⟩. ⟨hal-02889212⟩
233 Consultations
205 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More