Modular exponentiation

Modular exponentiation is a type of exponentiation performed over a modulus. It is useful in computer science, especially in the field of public-key cryptography.

The operation of modular exponentiation calculates the remainder when an integer $b$ (the base) raised to the $e$ th power (the exponent), $b e$ , is divided by a positive integer $m$ (the modulus). In symbols, given base $b$ , exponent $e$ , and modulus $m$ , the modular exponentiation $c$ is: $c = b e mod m$ . From the definition of $c$ , it follows that $0 \leq c < m$ .

For example, given $b = 5$ , $e = 3$ and $m = 13$ , the solution $c = 8$ is the remainder of dividing $53 = 125$ by $13$ .

Modular exponentiation can be performed with a negative exponent $e$ by finding the modular multiplicative inverse $d$ of $b$ modulo $m$ using the extended Euclidean algorithm. That is:

c = b e mod m = d - e mod m

, where

e < 0

and

b \cdot d \equiv 1 (mod m)

.

Modular exponentiation similar to the one described above is considered easy to compute, even when the integers involved are enormous. On the other hand, computing the modular discrete logarithm – that is, the task of finding the exponent $e$ when given $b$ , $c$ , and $m$ – is believed to be difficult. This one-way function behavior makes modular exponentiation a candidate for use in cryptographic algorithms.

Direct method

The most direct method of calculating a modular exponent is to calculate $b e$ directly, then to take this number modulo $m$ . Consider trying to compute $c$ , given $b = 4$ , $e = 13$ , and $m = 497$ :

c \equiv 4 13 (mod 497)

One could use a calculator to compute 4¹³; this comes out to 67,108,864. Taking this value modulo 497, the answer $c$ is determined to be 445.

Note that $b$ is only one digit in length and that $e$ is only two digits in length, but the value $b e$ is 8 digits in length.

In strong cryptography, $b$ is often at least 1024 bits.^[1] Consider $b = 5 \times 10 76$ and $e = 17$ , both of which are perfectly reasonable values. In this example, $b$ is 77 digits in length and $e$ is 2 digits in length, but the value $b e$ is 1,304 decimal digits in length. Such calculations are possible on modern computers, but the sheer magnitude of such numbers causes the speed of calculations to slow considerably. As $b$ and $e$ increase even further to provide better security, the value $b e$ becomes unwieldy.

The time required to perform the exponentiation depends on the operating environment and the processor. The method described above requires $O (e)$ multiplications to complete.

Memory-efficient method

A second method to compute modular exponentiation requires more operations than the first method. Because the required memory is substantially less, however, operations take less time than before. The end result is that the algorithm is faster.

This algorithm makes use of the fact that, given two integers $a$ and $b$ whose product is $c$ , the following two equations are equivalent:

c mod m = (a \cdot b) mod m

c mod m = [(a mod m) \cdot (b mod m)] mod m

The algorithm is as follows:

Set $c = 1$ , $e' = 0$ .
Increase $e'$ by 1.
Set $c = (b \cdot c) mod m$ .
If $e' < e$ , go to step 2. Else, $c$ contains the correct solution to $c \equiv b e (mod m)$ .

Note that in every pass through step 3, the equation $c \equiv b e' (mod m)$ holds true. When step 3 has been executed $e$ times, then, $c$ contains the answer that was sought. In summary, this algorithm basically counts up $e'$ by ones until $e'$ reaches $e$ , doing a multiply by $b$ and the modulo operation each time it adds one (to ensure the results stay small).

The example $b = 4$ , $e = 13$ , and $m = 497$ is presented again. The algorithm passes through step 3 thirteen times:

$e' = 1. c = (1 \cdot 4) mod 497 = 4 mod 497 = 4 .$
$e' = 2. c = (4 \cdot 4) mod 497 = 16 mod 497 = 16 .$
$e' = 3. c = (16 \cdot 4) mod 497 = 64 mod 497 = 64 .$
$e' = 4. c = (64 \cdot 4) mod 497 = 256 mod 497 = 256 .$
$e' = 5. c = (256 \cdot 4) mod 497 = 1024 mod 497 = 30 .$
$e' = 6. c = (30 \cdot 4) mod 497 = 120 mod 497 = 120 .$
$e' = 7. c = (120 \cdot 4) mod 497 = 480 mod 497 = 480 .$
$e' = 8. c = (480 \cdot 4) mod 497 = 1920 mod 497 = 429 .$
$e' = 9. c = (429 \cdot 4) mod 497 = 1716 mod 497 = 225 .$
$e' = 10. c = (225 \cdot 4) mod 497 = 900 mod 497 = 403 .$
$e' = 11. c = (403 \cdot 4) mod 497 = 1612 mod 497 = 121 .$
$e' = 12. c = (121 \cdot 4) mod 497 = 484 mod 497 = 484 .$
$e' = 13. c = (484 \cdot 4) mod 497 = 1936 mod 497 = 445 .$

The final answer for $c$ is therefore 445, as in the first method.

Like the first method, this requires $O(e)$ multiplications to complete. However, since the numbers used in these calculations are much smaller than the numbers used in the first algorithm's calculations, the computation time decreases by a factor of at least $O(e)$ in this method.

In pseudocode, this method can be performed the following way:

function modular_pow(base, exponent, modulus) is
    if modulus = 1 then
        return 0
    c := 1
    for e_prime = 0 to exponent-1 do
        c := (c * base) mod modulus
    return c

Right-to-left binary method

A third method drastically reduces the number of operations to perform modular exponentiation, while keeping the same memory footprint as in the previous method. It is a combination of the previous method and a more general principle called exponentiation by squaring (also known as binary exponentiation).

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

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 \leq i < n$ . By definition, $a n - 1 = 1$ .

The value $b e$ can then be written as:

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:

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

Pseudocode

The following is an example in pseudocode based on Applied Cryptography by Bruce Schneier.^[2] The inputs base, exponent, and modulus correspond to $b$ , $e$ , and $m$ in the equations given above.

function modular_pow(base, exponent, modulus) is
    if modulus = 1 then
        return 0
    Assert :: (modulus - 1) * (modulus - 1) does not overflow base
    result := 1
    base := base mod modulus
    while exponent > 0 do
        if (exponent mod 2 == 1) then
            result := (result * base) mod modulus
        exponent := exponent >> 1
        base := (base * base) mod modulus
    return result

Note that upon entering the loop for the first time, the code variable base is equivalent to $b$ . However, the repeated squaring in the third line of code ensures that at the completion of every loop, the variable base is equivalent to $b 2 i mod m$ , where $i$ is the number of times the loop has been iterated. (This makes $i$ the next working bit of the binary exponent exponent, where the least-significant bit is exponent₀).

The first line of code simply carries out the multiplication in $\prod _{i=0}^{n-1}\left(b^{2^{i}}\right)^{a_{i}}\ ({\mbox{mod}}\ m)$ . If $a i$ is zero, no code executes since this effectively multiplies the running total by one. If $a i$ instead is one, the variable base (containing the value $b 2 i mod m$ of the original base) is simply multiplied in.

In this example, the base $b$ is raised to the exponent $e=13$ . The exponent is 1101 in binary. There are four binary digits, so the loop executes four times. The bits in right-to-left order are 1, 0, 1, 1.

First, initialize the result $R$ to 1 and preserve the value of $b$ in the variable $x$ :

R\leftarrow 1\,(=b^{0}){\text{ and }}x\leftarrow b

.

Step 1) bit 1 is 1, so set

R\leftarrow R\cdot x{\text{ }}(=b^{1})

;

set

x\leftarrow x^{2}{\text{ }}(=b^{2})

.

Step 2) bit 2 is 0, so do not reset

R

;

set

x\leftarrow x^{2}{\text{ }}(=b^{4})

.

Step 3) bit 3 is 1, so set

R\leftarrow R\cdot x{\text{ }}(=b^{5})

;

set

x\leftarrow x^{2}{\text{ }}(=b^{8})

.

Step 4) bit 4 is 1, so set

R\leftarrow R\cdot x{\text{ }}(=b^{13})

;

This is the last step so we don't need to square

x

.

We are done: $R$ is now $b^{13}$ .

Here is the above calculation, where we compute $b=4$ to the power $e=13$ , performed modulo 497.

Initialize:

R\leftarrow 1\,(=b^{0})

and

x\leftarrow b=4

.

Step 1) bit 1 is 1, so set

R\leftarrow R\cdot 4{\pmod {497}}\equiv 4{\pmod {497}}

;

set

x\leftarrow x^{2}{\text{ }}(=b^{2})\equiv 4^{2}\equiv 16{\pmod {497}}

.

Step 2) bit 2 is 0, so do not reset

R

;

set

x\leftarrow x^{2}{\text{ }}(=b^{4})\equiv 16^{2}{\pmod {497}}\equiv 256{\pmod {497}}

.

Step 3) bit 3 is 1, so set

R\leftarrow R\cdot x{\text{ }}(=b^{5})\equiv 4\cdot 256{\pmod {497}}\equiv 30{\pmod {497}}

;

set

x\leftarrow x^{2}{\text{ }}(=b^{8})\equiv 256^{2}{\pmod {497}}\equiv 429{\pmod {497}}

.

Step 4) bit 4 is 1, so set

R\leftarrow R\cdot x{\text{ }}(=b^{13})\equiv 30\cdot 429{\pmod {497}}\equiv 445{\pmod {497}}

;

We are done: $R$ is now $4^{13}{\pmod {497}}\equiv 445{\pmod {497}}$ , the same result obtained in the previous algorithms.

The running time of this algorithm is $O(log$ exponent $)$ . When working with large values of exponent, this offers a substantial speed benefit over the previous two algorithms, whose time is $O($ exponent $)$ . For example, if the exponent was 2²⁰ = 1048576, this algorithm would have 20 steps instead of 1048576 steps.

Implementation in Lua

function modPow(b,e,m)
  if m == 1 then
    return 0
  else
    local r = 1
    b = b % m
    while e > 0 do
      if e % 2 == 1 then
        r = (r*b) % m
      end
      e = e >> 1     --use 'e = math.floor(e / 2)' on Lua 5.2 or older
      b = (b^2) % m
    end
    return r
  end
end

Left-to-right binary method

We can also use the bits of the exponent in left to right order. In practice, we would usually want the result modulo some modulus $m$ . In that case, we would reduce each multiplication result $(mod m)$ before proceeding. For simplicity, the modulus calculation is omitted here. This example shows how to compute $b^{13}$ using left to right binary exponentiation. The exponent is 1101 in binary; there are 4 bits, so there are 4 iterations.

Initialize the result to 1: $r\leftarrow 1\,(=b^{0})$ .

Step 1)

r\leftarrow r^{2}\,(=b^{0})

; bit 1 = 1, so compute

r\leftarrow r\cdot b\,(=b^{1})

;

Step 2)

r\leftarrow r^{2}\,(=b^{2})

; bit 2 = 1, so compute

r\leftarrow r\cdot b\,(=b^{3})

;

Step 3)

r\leftarrow r^{2}\,(=b^{6})

; bit 3 = 0, so we are done with this step;

Step 4)

r\leftarrow r^{2}\,(=b^{12})

; bit 4 = 1, so compute

r\leftarrow r\cdot b\,(=b^{13})

.

Minimum multiplications

In The Art of Computer Programming, Vol. 2, Seminumerical Algorithms, page 463, Donald Knuth notes that contrary to some assertions, this method does not always give the minimum possible number of multiplications. The smallest counterexample is for a power of 15, when the binary method needs six multiplications. Instead, form x³ in two multiplications, then x⁶ by squaring x³, then x¹² by squaring x⁶, and finally x¹⁵ by multiplying x¹² and x³, thereby achieving the desired result with only five multiplications. However, many pages follow describing how such sequences might be contrived in general.

Generalizations

Matrices

The $m$ -th term of any constant-recursive sequence (such as Fibonacci numbers or Perrin numbers) where each term is a linear function of $k$ previous terms can be computed efficiently modulo $n$ by computing $A m mod n$ , where $A$ is the corresponding $k \times k$ companion matrix. The above methods adapt easily to this application. This can be used for primality testing of large numbers $n$ , for example.

Pseudocode

A recursive algorithm for ModExp(A, b, c) = $A b mod c$ , where $A$ is a square matrix.

function Matrix_ModExp(Matrix A, int b, int c) is
    if b == 0 then
        return I  // The identity matrix
    if (b mod 2 == 1) then
        return (A * Matrix_ModExp(A, b - 1, c)) mod c
    Matrix D := Matrix_ModExp(A, b / 2, c)
    return (D * D) mod c

Finite cyclic groups

Diffie–Hellman key exchange uses exponentiation in finite cyclic groups. The above methods for modular matrix exponentiation clearly extend to this context. The modular matrix multiplication $C \equiv AB (mod n)$ is simply replaced everywhere by the group multiplication $c = ab$ .

Reversible and quantum modular exponentiation

In quantum computing, modular exponentiation appears as the bottleneck of Shor's algorithm, where it must be computed by a circuit consisting of reversible gates, which can be further broken down into quantum gates appropriate for a specific physical device. Furthermore, in Shor's algorithm it is possible to know the base and the modulus of exponentiation at every call, which enables various circuit optimizations.^[3]

Software implementations

Because modular exponentiation is an important operation in computer science, and there are efficient algorithms (see above) that are much faster than simply exponentiating and then taking the remainder, many programming languages and arbitrary-precision integer libraries have a dedicated function to perform modular exponentiation:

Python's built-in pow() (exponentiation) function [1] takes an optional third argument which is the number to modulo by
.NET Framework's BigInteger class has a ModPow() method to perform modular exponentiation
Java's java.math.BigInteger class has a modPow() method to perform modular exponentiation
Wolfram Language has the PowerMod function
Perl's Math::BigInt module has a bmodpow() method [2] to perform modular exponentiation
Raku has a built-in routine expmod.
Go's big.Int type contains an Exp() (exponentiation) method [3] whose third parameter, if non-nil, is the number to modulo by
PHP's BC Math library has a bcpowmod() function [4] to perform modular exponentiation
The GNU Multiple Precision Arithmetic Library (GMP) library contains a mpz_powm() function [5] to perform modular exponentiation
Custom Function @PowerMod() for FileMaker Pro (with 1024-bit RSA encryption example)
Ruby's openssl package has the OpenSSL::BN#mod_exp method [6] to perform modular exponentiation.
The HP Prime Calculator has the CAS.powmod() function [7] to perform modular exponentiation. For a^b mod c, a can be no larger than 1 EE 12. This is the maximum precision of most HP calculators including the Prime.

References

^ "Weak Diffie-Hellman and the Logjam Attack". weakdh.org. Retrieved 2019-05-03.
^ Schneier 1996, p. 244.
^ I. L. Markov, M. Saeedi (2012). "Constant-Optimized Quantum Circuits for Modular Multiplication and Exponentiation". Quantum Information and Computation. 12 (5–6): 0361–0394. arXiv:1202.6614. Bibcode:2012arXiv1202.6614M.

External links

Schneier, Bruce (1996). Applied Cryptography: Protocols, Algorithms, and Source Code in C, Second Edition (2nd ed.). Wiley. ISBN 978-0-471-11709-4.
Paul Garrett, Fast Modular Exponentiation Java Applet
Gordon, Daniel M. (1998). "A Survey of Fast Exponentiation Methods" (PDF). Journal of Algorithms. 27 (1). Elsevier BV: 129–146. doi:10.1006/jagm.1997.0913. ISSN 0196-6774.

[1] "Weak Diffie-Hellman and the Logjam Attack". weakdh.org. Retrieved 2019-05-03.

[schneier96p244-2] Schneier 1996, p. 244.

[3] I. L. Markov, M. Saeedi (2012). "Constant-Optimized Quantum Circuits for Modular Multiplication and Exponentiation". Quantum Information and Computation. 12 (5–6): 0361–0394. arXiv:1202.6614. Bibcode:2012arXiv1202.6614M.

[1]

[2]

[3]

v t e Number-theoretic algorithms
Primality tests	AKS APR Baillie–PSW Elliptic curve Pocklington Fermat Lucas Lucas–Lehmer Lucas–Lehmer–Riesel Proth's theorem Pépin's Quadratic Frobenius Solovay–Strassen Miller–Rabin
Prime-generating	Sieve of Atkin Sieve of Eratosthenes Sieve of Pritchard Sieve of Sundaram Wheel factorization
Integer factorization	Continued fraction (CFRAC) Dixon's Lenstra elliptic curve (ECM) Euler's Pollard's rho p − 1 p + 1 Quadratic sieve (QS) General number field sieve (GNFS) Special number field sieve (SNFS) Rational sieve Fermat's Shanks's square forms Trial division Shor's
Multiplication	Ancient Egyptian Long Karatsuba Toom–Cook Schönhage–Strassen Fürer's
Euclidean division	Binary Chunking Fourier Goldschmidt Newton-Raphson Long Short SRT
Discrete logarithm	Baby-step giant-step Pollard rho Pollard kangaroo Pohlig–Hellman Index calculus Function field sieve
Greatest common divisor	Binary Euclidean Extended Euclidean Lehmer's
Modular square root	Cipolla Pocklington's Tonelli–Shanks Berlekamp Kunerth
Other algorithms	Chakravala Cornacchia Exponentiation by squaring Integer square root Integer relation (LLL; KZ) Modular exponentiation Montgomery reduction Schoof Trachtenberg system
Italics indicate that algorithm is for numbers of special forms