O(n)-depth circuit algorithm for modular exponentiation
Teruo Hamano, Naofumi Takagi, Shuzo Yajima, F. P. Preparata · 2002
An O(n)-depth polynomial-size combinational circuit algorithm is proposed for n-bit modular exponentiation, i.e., for the computation of "x/sup y/ mod m" for arbitrary integers x, y and m. Represented as n-bit binary integers, within bounds 2/sup n-1//spl les/m>