• DocumentCode
    1180591
  • Title

    A new minimal average weight representation for left-to-right point multiplication methods

  • Author

    Khabbazian, Majid ; Gulliver, T. Aaron ; Bhargava, Vijay K.

  • Author_Institution
    Dept. of Electr. & Comput. Eng., British Columbia Univ., Canada
  • Volume
    54
  • Issue
    11
  • fYear
    2005
  • Firstpage
    1454
  • Lastpage
    1459
  • 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 2w-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 the time and space complexity of fast point multiplication techniques.
  • Keywords
    computational complexity; cryptography; digital arithmetic; multiplying circuits; elliptic curve cryptosystems; integer representation; left-to-right point multiplication; memory-constrained devices; minimal average weight representation; nonzero digit; radix-2 representation; Elliptic curve cryptography; Elliptic curves; Galois fields; Hamming weight; Senior members; Index Terms- Minimum-weight representation; efficient implementation; elliptic curve cryptosystems.; left-to-right recoding; point multiplication;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/TC.2005.173
  • Filename
    1514423