Memory-Efficient Fault Countermeasures - Smart Card Research and Advanced Applications Access content directly
Conference Papers Year : 2011

Memory-Efficient Fault Countermeasures

Marc Joye
  • Function : Author
  • PersonId : 968654
Mohamed Karroumi
  • Function : Author
  • PersonId : 1017800


An efficient countermeasure against fault attacks for a right-to-left binary exponentiation algorithm was proposed by Boscher, Naciri and Prouff (WISTP, 2007). This countermeasure was later generalized by Baek (Int. J. Inf. Sec., 2010) to the 2w-ary right-to-left algorithms for any $w \geqslant 1$ (the case w = 1 corresponding to the method of Boscher, Naciri and Prouff). In this paper, we modify theses algorithms, devise new coherence relations for error detection, and reduce the memory requirements without sacrificing the performance or the security. In particular, a full register (in working memory) can be gained compared to previous implementations. As a consequence, the implementations described in this paper are particularly well suited to applications for which memory is a premium. This includes smart-card implementations of exponentiation-based cryptosystems.
Fichier principal
Vignette du fichier
978-3-642-27257-8_6_Chapter.pdf (186.26 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-01596299 , version 1 (27-09-2017)




Marc Joye, Mohamed Karroumi. Memory-Efficient Fault Countermeasures. 10th Smart Card Research and Advanced Applications (CARDIS), Sep 2011, Leuven, Belgium. pp.84-101, ⟨10.1007/978-3-642-27257-8_6⟩. ⟨hal-01596299⟩
63 View
67 Download



Gmail Mastodon Facebook X LinkedIn More