A New Minimal Average Weight Representation for Left-to-Right Point Multiplication Methods

M.  Khabbazian; T. A.  Gulliver

Paper 2004/266

A New Minimal Average Weight Representation for Left-to-Right Point Multiplication Methods

M. Khabbazian and T. A. Gulliver

Abstract

This paper introduces a new radix-2 representation with the same average weight as the width- $w$ nonadjacent form ( $w$ -NAF). In both $w$ -NAF and the proposed representations, each nonzero digit is an odd integer with absolute value less than $M$ . However, for $w$ -NAF, $M$ is of the form $2^{w - 1}$ , while for the proposed representation it can be any positive integer. Therefore, using the proposed integer representation we can use the available memory efficiently, which is attractive for devices with limited memory. Another advantage of the proposed representation over $w$ -NAF is that it can be obtained by scanning the bits from left-to-right. This property is also useful for memory-constrained devices because it can reduce both time and space complexityof fast point multiplication techniques.

Metadata

Available format(s): PDF PS
Category: Public-key cryptography
Publication info: Published elsewhere. Unknown where it was published
Keywords: elliptic curve cryptosystem
Contact author(s): majidk @ ece ubc ca
History: 2004-10-15: received
Short URL: https://ia.cr/2004/266
License: CC BY

BibTeX

@misc{cryptoeprint:2004/266,
      author = {M.  Khabbazian and T. A.  Gulliver},
      title = {A New Minimal Average Weight Representation for Left-to-Right Point Multiplication Methods},
      howpublished = {Cryptology {ePrint} Archive, Paper 2004/266},
      year = {2004},
      url = {https://eprint.iacr.org/2004/266}
}