Addition-based exponentiation modulo 2 k

A. Fit-Florea, David W. Matula, Mitchell Aaron Thornton · Electronics Letters · 2005

A novel method for performing exponentiation modulo 2k is described. The algorithm has a critical path consisting of k dependent shift-and-add modulo 2k operations. Although 3 is the preferred exponent base, the algorithm can be extended easily in order to perform the general binary powering operation.

Read the paper · More papers on PaperTik