Question: Given integers a and b and assuming that the only operation available is modular multiplication, show how to compute, C = a^b mod p using the minimal number of modular multiplications.
Finding minimal number of modular multiplications.
1
$\begingroup$
number-theory
-
0There are lots of references at [A003313](http://oeis.org/A003313) – 2012-09-24