Breaking randomized mixed-radix scalar multiplication algorithms - Archive ouverte HAL Access content directly
Conference Papers Year : 2019

Breaking randomized mixed-radix scalar multiplication algorithms

(1) , (2)
1
2
Laurent Imbert

Abstract

In this paper we present a novel, powerful attack on a recently introduced randomized scalar multiplication algorithm based on covering systems of congruences. Our attack can recover the whole key with very few traces, even when those only provide partial information on the sequence of operations. In an attempt to solve the issues raised by the broken algorithm, we designed a constant-time version with no secret dependent branching nor memory access based on the so-called mixed-radix number system. We eventually present our conclusions regarding the use of mixed-radix representations as a randomization setting.
Fichier principal
Vignette du fichier
attack-csc.pdf (450.65 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

lirmm-02309203 , version 1 (09-10-2019)

Identifiers

Cite

Jérémie Detrey, Laurent Imbert. Breaking randomized mixed-radix scalar multiplication algorithms. LATINCRYPT 2019 - 6th International Conference on Cryptology and Information Security in Latin America, Oct 2019, Santiago de Chile, Chile. pp.24-39, ⟨10.1007/978-3-030-30530-7_2⟩. ⟨lirmm-02309203⟩
159 View
246 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More