Minimal arithmetic representation of a number N of base R to decompose computations in cryptography, uses partition of the number with transformation of partitioned elements to form a sequence of signed digits

摘要

The number decomposition commences with partition of the number into elements each containing a number of digits in which each pair of successive digits equal to the sub-base of the number. Each element is transformed to formed a sequence of signed digits. Different conditional transforms are used depending on whether there is an odd or even number of digits in the element.