Abstract:Binary signed digit representations (BSDR's) of integers have been studied since the 1950's. Their study was originally motivated by multiplication and division algorithms for integers and later by arithmetics on elliptic curves. Our paper is motivated by differential cryptanalysis of hash functions. We give an upper bound for the number of BSDR's of a given weight. Our result improves the upper bound on the number of BSDR's with minimal weight stated by Grabner and Heuberger in {\it On the number of optimal base $2$ representations\/}, Des. Codes Cryptogr. {\bf 40} (2006), 25--39, and introduce a new recursive upper bound for the number of BSDR's of any given weight.
Keywords: binary signed digit representation; NAF; minimal weight
DOI: DOI 10.14712/1213-7243.2015.129
AMS Subject Classification: 11A63 68R01