## CryptoDB

### Paper: A Simple Left-to-Right Algorithm for the Computation of the Arithmetic Weight of Integers

Authors: James A. Muir URL: http://eprint.iacr.org/2006/008 Search ePrint Search Google We present a simple algorithm for computing the arithmetic weight of an integer with respect to a given radix r>=2. 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 reported by Joye and Yen at PKC 2002. The idea behind our algorithm is that of choosing closest elements which was introduced by Muir and Stinson at CT-RSA 2005. Our results have applications in coding theory and in the efficient implementation of public-key cryptography.
##### BibTeX
@misc{eprint-2006-21502,
title={A Simple Left-to-Right Algorithm for the Computation of the Arithmetic Weight of Integers},
booktitle={IACR Eprint archive},
keywords={implementation / signed radix-r representations, left-to-right recoding, elliptic curve arithmetic},
url={http://eprint.iacr.org/2006/008},
note={ jamuir@scs.carleton.ca 13444 received 7 Jan 2006, last revised 23 Oct 2006},
author={James A. Muir},
year=2006
}