Paper 2005/402 Original: eprint.iacr.org/2005/402 ↗
Some Analysis of Radix-r Representations
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- Category
- Public-key cryptography
- Publication info
- Preprint.
- History
- 2005-11-14: last updated
- 2005-11-14: published
- Short URL
- https://ia.cr/2005/402
- License
- https://creativecommons.org/licenses/by/4.0/
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},
url = {https://eprint.iacr.org/2005/402}
}