New left-to-right minimal weight signed-digit radix-r representation
Computers and Electrical Engineering
Unbalanced digit sets and the closest choice strategy for minimal weight integer representations
Designs, Codes and Cryptography
New left-to-right radix-r signed-digit recoding algorithm for pairing-based cryptosystems
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
| Hi-index | 754.84 |
We present a simple algorithm for computing the arithmetic weight of an integer with respect to a given radix rges2. The arithmetic weight of n is the minimum number of nonzero digits in any signed radix-r representation of n. This algorithm leads to a new family of minimal weight signed radix-r representations which can be constructed using a left-to-right on-line algorithm. These representations are different from the ones previously discovered by Joye and Yen. The idea behind our algorithm is that of choosing closest elements which was introduced by Muir and Stinson. Our results have applications in coding theory and in the efficient implementation of public-key cryptography