Paper 2004/342

A comb method to render ECC resistant against Side Channel Attacks

Mustapha Hedabou, Pierre Pinel, and Lucien Bénéteau

Abstract

Side Channel Attacks may exploit leakage information to break cryptosystems on smard card devices. In this paper we present a new SCA-resistant elliptic curve scalar multiplication algorithm, based on the Lim and Lee technique. The proposed algorithm builds a sequence of bit-strings representing the scalar $k$, characterized by the fact that all bit-strings are different from zero; this property will ensure a uniform computation behaviour for the algorithm, and thus will make it secure against SPA (Simple Power Analysis) attacks. The use of a recently introduced randomization technique achieves the security of the proposed scheme against other SCA attacks. Furthermore, the proposed countermeasures do not penalize the computation time

Metadata
Available format(s)
PDF PS
Category
Implementation
Publication info
Published elsewhere. paper submitted only to the Cryptology ePrint Archive.
Keywords
ECCSCA attacksscalar multiplication
Contact author(s)
hedabou @ insa-toulouse fr
History
2004-12-07: received
Short URL
https://ia.cr/2004/342
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2004/342,
      author = {Mustapha Hedabou and Pierre Pinel and Lucien Bénéteau},
      title = {A  comb method to render {ECC} resistant against Side Channel Attacks},
      howpublished = {Cryptology {ePrint} Archive, Paper 2004/342},
      year = {2004},
      url = {https://eprint.iacr.org/2004/342}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.