Distribution results for low-weight binary representations for pairs of integers (Q596061)

With an eye to the primary application being the group law for addition on an elliptic curve, the authors look at the computational cost of such operations in cryptosystems. In order to minimize so-called Hamming weights, they consider what is called the simple joint sparse form. This mechanism is the central focus of the paper, and is considered from geometrical and topological viewpoints, with a ``central limit theorem'' for the Hamming weight as one of their goals. They conclude the paper with remarks concerning the necessity for, but current lack of, a higher order analogue of the joint sparse form.