Common-multiplicand multiplication and its applications to public key cryptography

Abstract

Efficient computations of {X + Yi|i = 1, 2,…,t; t ≥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.