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

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/sup 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 the time and space complexity of fast point multiplication techniques.

[1]  Volker Müller.  Fast Multiplication on Elliptic Curves over Small Fields of Characteristic Two , 1998, Journal of Cryptology.

[2]  T. Elgamal.  A public key cryptosystem and a signature scheme based on discrete logarithms , 1984, CRYPTO 1984.

[3]  Alfred Menezes,et al.  Handbook of Applied Cryptography , 2018 .

[4]  Victor S. Miller,et al.  Use of Elliptic Curves in Cryptography , 1985, CRYPTO.

[5]  Douglas R. Stinson,et al.  Minimality and other properties of the width-w nonadjacent form , 2005, Math. Comput..

[6]  Jerome A. Solinas,et al.  Efficient Arithmetic on Koblitz Curves , 2000, Des. Codes Cryptogr..

[7]  Earl E. Swartzlander,et al.  Computer Arithmetic , 1980 .

[8]  Kai Hwang,et al.  Computer arithmetic: Principles, architecture, and design , 1979 .

[9]  Tsuyoshi Takagi,et al.  Signed Binary Representations Revisited , 2004, CRYPTO.

[10]  Marc Joye,et al.  Optimal Left-to-Right Binary Signed-Digit Recoding , 2000, IEEE Trans. Computers.

[11]  N. Koblitz.  Elliptic curve cryptosystems , 1987 .

[12]  Kouichi Sakurai,et al.  Efficient Scalar Multiplications on Elliptic Curves with Direct Computations of Several Doublings , 2001 .

[13]  Rajendra S. Katti,et al.  Speeding up elliptic cryptosystems using a new signed binary representation for integers , 2002, Proceedings Euromicro Symposium on Digital System Design. Architectures, Methods and Tools.

[14]  Christof Paar,et al.  Efficient Algorithms for Elliptic Curve Cryptosystems , 1997, CRYPTO.

[15]  Bodo Möller,et al.  Improved Techniques for Fast Exponentiation , 2002, ICISC.

[16]  Douglas R. Stinson,et al.  New Minimal Weight Representations for Left-to-Right Window Methods , 2005, CT-RSA.

[17]  Jacobus H. van Lint,et al.  Introduction to Coding Theory , 1982 .

[18]  Çetin Kaya Koç.  Parallel canonical recoding , 1996 .

[19]  Andrew D. Booth,et al.  A SIGNED BINARY MULTIPLICATION TECHNIQUE , 1951 .

[20]  Ian F. Blake,et al.  Elliptic curves in cryptography , 1999 .

[21]  Whitfield Diffie,et al.  New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.

[22]  Daniel M. Gordon,et al.  A Survey of Fast Exponentiation Methods , 1998, J. Algorithms.