Comment on "Fast square-and-multiply exponentiation for RSA"

Recently Hui and Lam announced that they had developed a new technique for improving the performance of RSA computation based on the square-and-multiply exponentiation [see ibid., vol. 30, no. 17, p. 1396-7, 1994]. In fact, their proposed algorithm is a well-known approach to exponentiation termed the m-ary method which essentially is a modification of the standard square-and-multiply algorithm