arXiv · 1303.2819
Analysis of the binary asymmetric joint sparse form
Abstract
We consider redundant binary joint digital expansions of integer vectors. The redundancy is used to minimize the Hamming weight, i.e., the number of nonzero digit vectors. This leads to efficient linear combination algorithms in abelian groups, which are for instance used in elliptic curve cryptography. If the digit set is a set of contiguous integers containing the zero, a special syntactical condition is known to minimize the weight. We analyze the optimal weight of all non-negative integer vectors with maximum entry less than N. The expectation and the variance are given with a main term and a periodic fluctuation in the second order term. Finally, we prove asymptotic normality.
Explore related subjects
Keep this discovery
Clemens Heuberger, Sara Kropf. 2014-02-10. Analysis of the binary asymmetric joint sparse form. https://doi.org/10.1017/s0963548314000352
Cite the original work for its findings. Save a collection to share your selection of sources.