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.
No takes yet. Share an insight, caveat, or question.
Yen et al. (1993) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: