SPA Resistant Left-to-Right Integer Recodings

Nicolas Thériault

Paper 2005/125

SPA Resistant Left-to-Right Integer Recodings

Nicolas Thériault

Abstract

We introduce two new left-to-right integer recodings which can be used to perform scalar multiplication with a fixed sequence of operations. These recodings make it possible to have a simple power analysis resistant implementation of a group-based cryptosystem without using unified formulas or introducing dummy operations. This approach is very useful for groups in which the doubling step are less expensive than the addition step, for example with hyperelliptic curves over binary fields or elliptic curves with mixed coordinates.

Metadata

Available format(s): PDF PS
Category: Public-key cryptography
Publication info: Published elsewhere. Unknown where it was published
Keywords: public-key cryptography elliptic curve cryptosystem hyperelliptic curve cryptosystem side-channel attacks countermeasures
Contact author(s): ntheriau @ math uwaterloo ca
History: 2005-05-17: last of 2 revisions; 2005-04-29: received; See all versions
Short URL: https://ia.cr/2005/125
License: CC BY

BibTeX

@misc{cryptoeprint:2005/125,
      author = {Nicolas Thériault},
      title = {{SPA} Resistant Left-to-Right Integer Recodings},
      howpublished = {Cryptology {ePrint} Archive, Paper 2005/125},
      year = {2005},
      url = {https://eprint.iacr.org/2005/125}
}