Effect of Improved Multiplication Efficiency on Exponentiation Algorithms Derived from Addition Chains
D. P. McCarthy · Mathematics of Computation · 1986
The interaction between the efficiency of the basic multiplication algorithm and the addition chain used to compute ${x^n}$ is studied. We conclude that either repeated multiplication by x or repeated squaring should be used and the provenance of each technique is established.