Improved generalisation common-multiplicand multiplications algorithm of Yen and Laih

Yen and Laih (1993) proposed an algorithm for efficient computation of the common-multiplicand multiplications problem {X×Y_i|i=1, 2, ..., t; t⩾2}, which is very useful for public key cryptographic exponentiation computation. By using a k-times folding technique, the authors present an improved generalisation of the algorithm of Yen and Laih and show that the improvement needs fewer multiplications compared with the original algorithm of Yen and Laih