Title :
Efficiency of SS(I) square-and-multiply exponentiation algorithms
Author :
Lam, Kam-Yiu ; Hui, Lucas C. K.
Author_Institution :
Dept. of Inf. Syst. & Comput. Sci., Nat. Univ. of Singapore
fDate :
12/8/1994 12:00:00 AM
Abstract :
SS(l) has been demonstrated experimentally to be the fastest square-and-multiply exponentiation scheme based on precomputation and string substitution. The authors provide a complete proof of the efficiency of the SS(l) algorithm. They show that SS(l) is a minimum weight representation scheme and prove that the expected weight of an n-bit SS(l)-represented exponent is n/(l+1) for large n
Keywords :
algorithm theory; SS(l) algorithm efficiency; minimum weight representation scheme; precomputation; square-and-multiply exponentiation algorithms; string substitution;
Journal_Title :
Electronics Letters
DOI :
10.1049/el:19941424
