Modular integer exponentiation (given <italic>a, e,</italic> and <italic>m</italic>, compute <italic>a</italic><supscrpt>e</supscrpt> mod <italic>m</italic>) is a fundamental problem in algebraic complexity for which no efficient parallel algorithm is known. Two closely related problems are modular polynomial exponentiation (given <italic>a</italic>(<italic… (More)