On binary signed digit representations of integers

Authors:
Nevine Ebeid;M. Anwar Hasan
Affiliations:
Department of Electrical and Computer Engineering and Centre for Applied Cryptographic Research, University of Waterloo, Waterloo Ontario, Canada;Department of Electrical and Computer Engineering and Centre for Applied Cryptographic Research, University of Waterloo, Waterloo Ontario, Canada
Venue:
Designs, Codes and Cryptography
Year:
2007

Citing 2
Cited 3

Efficient Arithmetic on Koblitz Curves

Designs, Codes and Cryptography - Special issue on towards a quarter-century of public key cryptography
Randomized Signed-Scalar Multiplication of ECC to Resist Power Attacks

CHES '02 Revised Papers from the 4th International Workshop on Cryptographic Hardware and Embedded Systems

On Τ-adic representations of integers

Designs, Codes and Cryptography
A matrix approach for FCSR automata

Cryptography and Communications
UNAF: a special set of additive differences with application to the differential analysis of ARX

FSE'12 Proceedings of the 19th international conference on Fast Software Encryption

Quantified Score

Hi-index	0.00

Visualization

Abstract

Applications of signed digit representations of an integer include computer arithmetic, cryptography, and digital signal processing. An integer of length n bits can have several binary signed digit (BSD) representations and their number depends on its value and varies with its length. In this paper, we present an algorithm that calculates the exact number of BSDR of an integer of a certain length. We formulate the integer that has the maximum number of BSDR among all integers of the same length. We also present an algorithm to generate a random BSD representation for an integer starting from the most significant end and its modified version which generates all possible BSDR. We show how the number of BSD representations of k increases as we prepend 0s to its binary representation.