Skip to Main content Skip to Navigation
New interface
Conference papers

Memory-Efficient Fault Countermeasures

Abstract : 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.
Complete list of metadata

Cited literature [28 references]  Display  Hide  Download
Contributor : Hal Ifip Connect in order to contact the contributor
Submitted on : Wednesday, September 27, 2017 - 2:46:18 PM
Last modification on : Tuesday, October 10, 2017 - 1:47:57 PM
Long-term archiving on: : Thursday, December 28, 2017 - 1:51:13 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



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⟩



Record views


Files downloads