Common-multiplicand multiplication and its applications to public key cryptography

Efficient computations of (X+Y _i mod i=1, 2, . . ., t; t>or=2), which is called the common-multiplicand multiplication problem, are considered. An algorithm is proposed for this problem and it is very useful for the exponentiation computations of public key cryptography.<>