In particular, we present several novel exponentiation algorithms, namely a protected square-and-multiply algorithm, its right-to-left counterpart, and several protected sliding-window algorithms. We also illustrate our methodology applied to point multiplication on elliptic curves. All these algorithms share the common feature that the complexity is globally unchanged compared to the corresponding unprotected implementations.
Category / Keywords: implementation / Cryptographic algorithms, side-channel analysis, protected implementations, atomicity, exponentiation, elliptic curves Date: received 12 Nov 2003, last revised 12 Nov 2003 Contact author: marc joye at gemplus com Available formats: Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation Version: 20031112:162251 (All versions of this report) Discussion forum: Show discussion | Start new discussion