Repeated squaring

Repeated squaring computes $a^n$ using $O(\log n)$ multiplications by reading the binary expansion of $n$. Performing every multiplication modulo $m$ computes $a^n\mathrm{mod}m$ with the same number of modular multiplications.