Fast Modular Exponentiation

算法分析

First, it is required that the exponent e be converted to binary notation. That is, e can be written as:

{\displaystyle e=\sum _{i=0}^{n-1}a_{i}2^{i}}

In such notation, the length of e is n bits. a_i can take the value 0 or 1 for any i such that 0 ≤ i < n. By definition, a_{n − 1} = 1.

The value b^e can then be written as:

{\displaystyle b^{e}=b^{\left(\sum _{i=0}^{n-1}a_{i}2^{i}\right)}=\prod _{i=0}^{n-1}\left(b^{2^{i}}\right)^{a_{i}}}

The solution c is therefore:

{\displaystyle c\equiv \prod _{i=0}^{n-1}\left(b^{2^{i}}\right)^{a_{i}}\ ({\mbox{mod}}\ m)}

C++实现

int pow_mod(int a, int n, int mod){
    int r = 1 % mod;
    while (n) {
        if (n&1)
            r = (ll)r*a%mod;
        a = (ll)a*a%mod;
        n >>= 1;
    }

    return r;
}

Reference

1. http://www.dragonwins.com/domains/getteched/crypto/modular_exponentiation.htm

2. https://www.khanacademy.org/computing/computer-science/cryptography/modarithmetic/a/fast-modular-exponentiation

3. https://en.wikipedia.org/wiki/Modular_exponentiation