Efficient Integer Representations for Cryptographic Operations

Every positive integer has a unique radix 2 representation which uses the digits {0, 1}. However, if we allow digits other than 0 and 1, say {0, 1,−1}, then a positive integer has many representations. Of these redundant representations, it is possible to choose one that has few nonzero digits. It is well known that using representations of integers with few nonzero digits allows certain algebraic operations to be done more quickly. This thesis is concerned with various representations of integers that are related to efficient implementations of algebraic operations in cryptographic algorithms. The topics covered here include: –The width-w nonadjacent form (w-NAF). We prove that the w-NAF of an integer has a minimal number of nonzero digits; that is, no other representation of an integer, which uses the w-NAF digits, can have fewer nonzero digits than its w-NAF. –A left-to-right analogue of the w-NAF. We introduce a new family of radix 2 representations which use the same digits as the w-NAF, but have the property that they can be computed by sliding a window from left to right across the binary representation of an integer. We show these new representations have a minimal number of nonzero digits. –Joint representations. Solinas introduced a {0, 1,−1}-radix 2 representation for pairs of integers called the joint sparse form. We consider generalizations of the joint sparse form which represent r ≥ 2 integers and use digits other than {0, 1,−1}. We show how to construct a {0, 1, 2, 3}-joint representation that has a minimal number of nonzero columns. –Nonadjacent digit sets. It is well known that if x equals 3 or −1 then every nonnegative integer has a unique {0, 1, x}-nonadjacent form; that is, a {0, 1, x}-radix 2 representation with the property that, of any two consecutive digits, at most one is nonzero. We investigate what other values of x have this property.