Paper 2005/402

Some Analysis of Radix-r Representations

Dong-Guk Han and Tsuyoshi Takagi

Abstract

We deal with the radix-r representation used for the scalar multiplication of pairing-based cryptosystems with characteristic r. Our goal of this paper is to present some invariant properties about the signed radix-r representation; (1) approximation formulae for the average significant length and the average hamming weight of gNAF and wrNAF representation, (2) some classification formulae of equivalent classes called as Cutting Lemma, Collision Lemma, and Search Space Theorem. We also analyze the security of signed radix-r representations in the sense of side channel attacks, and to this end we propose a secure countermeasure.

Metadata
Available format(s)
PDF PS
Category
Public-key cryptography
Publication info
Published elsewhere. Unknown where it was published
Keywords
pairing-based cryptosystemsradix-r representationgNAFwrNAFside channel attacks.
Contact author(s)
christa @ fun ac jp
History
2005-11-14: received
Short URL
https://ia.cr/2005/402
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2005/402,
      author = {Dong-Guk Han and Tsuyoshi Takagi},
      title = {Some Analysis of Radix-r Representations},
      howpublished = {Cryptology ePrint Archive, Paper 2005/402},
      year = {2005},
      note = {\url{https://eprint.iacr.org/2005/402}},
      url = {https://eprint.iacr.org/2005/402}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.