Exponentiation By Squaring

Some variants are commonly referred to as square-and-multiply algorithms or binary exponentiation. These can be of quite general use, for example in modular arithmetic or powering of matrices. For semigroups for which additive notation is commonly used, like elliptic curves used in cryptography, this method is also referred to as double-and-add.

Recursive version

The method is based on the observation that, for any integer ${\displaystyle n>0}$ , one has:

$${\displaystyle x^{n}={\begin{cases}x\,(x^{2})^{(n-1)/2},&{\mbox{if }}n{\mbox{ is odd}}\\(x^{2})^{n/2},&{\mbox{if }}n{\mbox{ is even}}\end{cases}}}$$

 

If the exponent is zero then the answer is 1 and if the exponent is negative then we can reuse the previous formula by rewriting the value using a positive exponent. That is,

$${\displaystyle x^{-n}=\left({\frac {1}{x}}\right)^{n}\,.}$$

 

Together, these may be implemented directly as the following recursive algorithm:

 In: an integer x; an integer n  Out: xn    exp_by_squaring(x, n)    if n < 0 then       return 1 / exp_by_squaring(x, -n);    else if n = 0 then        return 1;    else if n is even then        return exp_by_squaring(x * x, n / 2);    else if n is odd then        return x * exp_by_squaring(x * x, (n - 1) / 2);  end function  

In each recursive call, the least significant digits of the binary representation of n is removed. It follows that the number of recursive calls is ${\displaystyle \lceil \log _{2}n\rceil ,}$  the number of bits of the binary representation of n. So this algorithm computes this number of squares and a lower number of multiplication, which is equal to the number of 1 in the binary representation of n. This logarithmic number of operations is to be compared with the trivial algorithm which requires n − 1 multiplications.

This algorithm is not tail-recursive. This implies that it requires an amount of auxiliary memory that is roughly proportional to the number of recursive calls -- or perhaps higher if the amount of data per iteration is increasing.

The algorithms of the next section use a different approach, and the resulting algorithms needs the same number of operations, but use an auxiliary memory that is roughly the same as the memory required to store the result.

With constant auxiliary memory

The variants described in this section are based on the formula

${\displaystyle yx^{n}={\begin{cases}(yx)\,(x^{2})^{(n-1)/2},&{\mbox{if }}n{\mbox{ is odd}}\\y\,(x^{2})^{n/2},&{\mbox{if }}n{\mbox{ is even}}.\end{cases}}}$ 

If one applies recursively this formula, by starting with y = 1, one gets eventually an exponent equal to 0, and the desired result is then the left factor.

This may be implemented as a tail-recursive function:

  Function exp_by_squaring(x, n)     return exp_by_squaring2(1, x, n)   Function exp_by_squaring2(y, x, n)     if n < 0 then return exp_by_squaring2(y, 1 / x, -n);     else if n = 0 then return y;     else if n is even then return exp_by_squaring2(y, x * x, n / 2);     else if n is odd then return exp_by_squaring2(x * y, x * x, (n - 1) / 2). 

The iterative version of the algorithm also uses a bounded auxiliary space, and is given by

  Function exp_by_squaring_iterative(x, n)     if n < 0 then       x := 1 / x;       n := -n;     if n = 0 then return 1     y := 1;     while n > 1 do       if n is odd then         y := x * y;         n := n - 1;       x := x * x;       n := n / 2;     return x * y 

The correctness of the algorithm results from the fact that ${\displaystyle yx^{n}}$  is invariant during the computation; it is ${\displaystyle 1\cdot x^{n}=x^{n}}$  at the beginning; and it is ${\displaystyle yx^{1}=xy}$  at the end.

These algorithms use exactly the same number of operations as the algorithm of the preceding section, but the multiplications are done in a different order.

A brief analysis shows that such an algorithm uses ${\displaystyle \lfloor \log _{2}n\rfloor }$  squarings and at most ${\displaystyle \lfloor \log _{2}n\rfloor }$  multiplications, where ${\displaystyle \lfloor \;\rfloor }$  denotes the floor function. More precisely, the number of multiplications is one less than the number of ones present in the binary expansion of n. For n greater than about 4 this is computationally more efficient than naively multiplying the base with itself repeatedly.

Each squaring results in approximately double the number of digits of the previous, and so, if multiplication of two d-digit numbers is implemented in O(d^k) operations for some fixed k, then the complexity of computing xⁿ is given by

${\displaystyle \sum \limits _{i=0}^{O(\log n)}{\big (}2^{i}O(\log x){\big )}^{k}=O{\big (}(n\log x)^{k}{\big )}.}$ 

This algorithm calculates the value of xⁿ after expanding the exponent in base 2^k. It was first proposed by Brauer in 1939. In the algorithm below we make use of the following function f(0) = (k, 0) and f(m) = (s, u), where m = u·2^s with u odd.

Algorithm:

Input
An element x of G, a parameter k > 0, a non-negative integer n = (n_l−1, n_l−2, ..., n₀)_2^k and the precomputed values ${\displaystyle x^{3},x^{5},...,x^{2^{k}-1}}$ .

Output
The element xⁿ in G

y := 1; i := l - 1 while i ≥ 0 do     (s, u) := f(ni)     for j := 1 to k - s do         y := y2     y := y * xu     for j := 1 to s do         y := y2     i := i - 1 return y 

For optimal efficiency, k should be the smallest integer satisfying

${\displaystyle \lg n<{\frac {k(k+1)\cdot 2^{2k}}{2^{k+1}-k-2}}+1.}$ 

This method is an efficient variant of the 2^k-ary method. For example, to calculate the exponent 398, which has binary expansion (110 001 110)₂, we take a window of length 3 using the 2^k-ary method algorithm and calculate 1, x³, x⁶, x¹², x²⁴, x⁴⁸, x⁴⁹, x⁹⁸, x⁹⁹, x¹⁹⁸, x¹⁹⁹, x³⁹⁸. But, we can also compute 1, x³, x⁶, x¹², x²⁴, x⁴⁸, x⁹⁶, x¹⁹², x¹⁹⁹, x³⁹⁸, which saves one multiplication and amounts to evaluating (110 001 110)₂

Here is the general algorithm:

Algorithm:

Input
An element x of G, a non negative integer n=(n_l−1, n_l−2, ..., n₀)₂, a parameter k > 0 and the pre-computed values ${\displaystyle x^{3},x^{5},...,x^{2^{k}-1}}$ .

Output
The element xⁿ ∈ G.

Algorithm:

y := 1; i := l - 1 while i > -1 do     if ni = 0 then         y := y2' i := i - 1     else         s := max{i - k + 1, 0}         while ns = 0 do             s := s + 1         for h := 1 to i - s + 1 do             y := y2         u := (ni, ni-1, ..., ns)2         y := y * xu         i := s - 1 return y 

Many algorithms for exponentiation do not provide defence against side-channel attacks. Namely, an attacker observing the sequence of squarings and multiplications can (partially) recover the exponent involved in the computation. This is a problem if the exponent should remain secret, as with many public-key cryptosystems. A technique called "Montgomery's ladder" addresses this concern.

Given the binary expansion of a positive, non-zero integer n = (n_k−1...n₀)₂ with n_k−1 = 1, we can compute xⁿ as follows:

x1 = x; x2 = x2 for i = k - 2 to 0 do     if ni = 0 then         x2 = x1 * x2; x1 = x12     else         x1 = x1 * x2; x2 = x22 return x1 

The algorithm performs a fixed sequence of operations (up to log n): a multiplication and squaring takes place for each bit in the exponent, regardless of the bit's specific value. A similar algorithm for multiplication by doubling exists.

This specific implementation of Montgomery's ladder is not yet protected against cache timing attacks: memory access latencies might still be observable to an attacker, as different variables are accessed depending on the value of bits of the secret exponent. Modern cryptographic implementations use a "scatter" technique to make sure the processor always misses the faster cache.

There are several methods which can be employed to calculate xⁿ when the base is fixed and the exponent varies. As one can see, precomputations play a key role in these algorithms.

Yao's method

Yao's method is orthogonal to the 2^k-ary method where the exponent is expanded in radix b = 2^k and the computation is as performed in the algorithm above. Let n, n_i, b, and b_i be integers.

Let the exponent n be written as

${\displaystyle n=\sum _{i=0}^{w-1}n_{i}b_{i},}$ 

where ${\displaystyle 0\leqslant n_{i}$  for all ${\displaystyle i\in [0,w-1]}$ .

Let x_i = x^b_i.

Then the algorithm uses the equality

${\displaystyle x^{n}=\prod _{i=0}^{w-1}x_{i}^{n_{i}}=\prod _{j=1}^{h-1}{\bigg [}\prod _{n_{i}=j}x_{i}{\bigg ]}^{j}.}$ 

Given the element x of G, and the exponent n written in the above form, along with the precomputed values x^b₀...x^b_w−1, the element xⁿ is calculated using the algorithm below:

y = 1, u = 1, j = h - 1 while j > 0 do     for i = 0 to w - 1 do         if ni = j then             u = u × xbi     y = y × u     j = j - 1 return y 

If we set h = 2^k and b_i = hⁱ, then the n_i values are simply the digits of n in base h. Yao's method collects in u first those x_i that appear to the highest power ${\displaystyle h-1}$ ; in the next round those with power ${\displaystyle h-2}$  are collected in u as well etc. The variable y is multiplied ${\displaystyle h-1}$  times with the initial u, ${\displaystyle h-2}$  times with the next highest powers, and so on. The algorithm uses ${\displaystyle w+h-2}$  multiplications, and ${\displaystyle w+1}$  elements must be stored to compute xⁿ.

Euclidean method

The Euclidean method was first introduced in Efficient exponentiation using precomputation and vector addition chains by P.D Rooij.

This method for computing ${\displaystyle x^{n}}$  in group G, where n is a natural integer, whose algorithm is given below, is using the following equality recursively:

${\displaystyle x_{0}^{n_{0}}\cdot x_{1}^{n_{1}}=\left(x_{0}\cdot x_{1}^{q}\right)^{n_{0}}\cdot x_{1}^{n_{1}\mod n_{0}},}$ 

where ${\displaystyle q=\left\lfloor {\frac {n_{1}}{n_{0}}}\right\rfloor }$ . In other words, a Euclidean division of the exponent n₁ by n₀ is used to return a quotient q and a rest n₁ mod n₀.

Given the base element x in group G, and the exponent ${\displaystyle n}$  written as in Yao's method, the element ${\displaystyle x^{n}}$  is calculated using ${\displaystyle l}$  precomputed values ${\displaystyle x^{b_{0}},...,x^{b_{l_{i}}}}$  and then the algorithm below.

Begin loop     Find ${\displaystyle M\in [0,l-1]}$ , such that ${\displaystyle \forall i\in [0,l-1],n_{M}\geq n_{i}}$ .     Find ${\displaystyle N\in {\big (}[0,l-1]-M{\big )}}$ , such that ${\displaystyle \forall i\in {\big (}[0,l-1]-M{\big )},n_{N}\geq n_{i}}$ .     Break loop if ${\displaystyle n_{N}=0}$ .     Let ${\displaystyle q=\lfloor n_{M}/n_{N}\rfloor }$ , and then let ${\displaystyle n_{N}=(n_{M}{\bmod {n}}_{N})}$ .     Compute recursively ${\displaystyle x_{M}^{q}}$ , and then let ${\displaystyle x_{N}=x_{N}\cdot x_{M}^{q}}$ . End loop; Return ${\displaystyle x^{n}=x_{M}^{n_{M}}}$ . 

The algorithm first finds the largest value among the n_i and then the supremum within the set of { n_i \ i ≠ M }. Then it raises x_M to the power q, multiplies this value with x_N, and then assigns x_N the result of this computation and n_M the value n_M modulo n_N.

The approach also works with semigroups that are not of characteristic zero, for example allowing fast computation of large exponents modulo a number. Especially in cryptography, it is useful to compute powers in a ring of integers modulo q. For example, the evaluation of

13789⁷²²³⁴¹ (mod 2345) = 2029

would take a very long time and much storage space if the naïve method of computing 13789⁷²²³⁴¹ and then taking the remainder when divided by 2345 were used. Even using a more effective method will take a long time: square 13789, take the remainder when divided by 2345, multiply the result by 13789, and so on.

Applying above exp-by-squaring algorithm, with "*" interpreted as x * y = xy mod 2345 (that is, a multiplication followed by a division with remainder) leads to only 27 multiplications and divisions of integers, which may all be stored in a single machine word. Generally, any of these approaches will take fewer than 2log₂(722340) ≤ 40 modular multiplications.

The approach can also be used to compute integer powers in a group, using either of the rules

Power(x, −n) = Power(x⁻¹, n),
Power(x, −n) = (Power(x, n))⁻¹.

The approach also works in non-commutative semigroups and is often used to compute powers of matrices.

More generally, the approach works with positive integer exponents in every magma for which the binary operation is power associative.

In certain computations it may be more efficient to allow negative coefficients and hence use the inverse of the base, provided inversion in G is "fast" or has been precomputed. For example, when computing x^2k−1, the binary method requires k−1 multiplications and k−1 squarings. However, one could perform k squarings to get x^2k and then multiply by x⁻¹ to obtain x^2k−1.

To this end we define the signed-digit representation of an integer n in radix b as

${\displaystyle n=\sum _{i=0}^{l-1}n_{i}b^{i}{\text{ with }}|n_{i}|$ 

Signed binary representation corresponds to the particular choice b = 2 and ${\displaystyle n_{i}\in \{-1,0,1\}}$ . It is denoted by ${\displaystyle (n_{l-1}\dots n_{0})_{s}}$ . There are several methods for computing this representation. The representation is not unique. For example, take n = 478: two distinct signed-binary representations are given by ${\displaystyle (10{\bar {1}}1100{\bar {1}}10)_{s}}$  and ${\displaystyle (100{\bar {1}}1000{\bar {1}}0)_{s}}$ , where ${\displaystyle {\bar {1}}}$  is used to denote −1. Since the binary method computes a multiplication for every non-zero entry in the base-2 representation of n, we are interested in finding the signed-binary representation with the smallest number of non-zero entries, that is, the one with minimal Hamming weight. One method of doing this is to compute the representation in non-adjacent form, or NAF for short, which is one that satisfies ${\displaystyle n_{i}n_{i+1}=0{\text{ for all }}i\geqslant 0}$  and denoted by ${\displaystyle (n_{l-1}\dots n_{0})_{\text{NAF}}}$ . For example, the NAF representation of 478 is ${\displaystyle (1000{\bar {1}}000{\bar {1}}0)_{\text{NAF}}}$ . This representation always has minimal Hamming weight. A simple algorithm to compute the NAF representation of a given integer ${\displaystyle n=(n_{l}n_{l-1}\dots n_{0})_{2}}$  with ${\displaystyle n_{l}=n_{l-1}=0}$  is the following:

${\displaystyle c_{0}=0}$  for i = 0 to l − 1 do   ${\displaystyle c_{i+1}=\left\lfloor {\frac {1}{2}}(c_{i}+n_{i}+n_{i+1})\right\rfloor }$    ${\displaystyle n_{i}'=c_{i}+n_{i}-2c_{i+1}}$  return ${\displaystyle (n_{l-1}'\dots n_{0}')_{\text{NAF}}}$  

Another algorithm by Koyama and Tsuruoka does not require the condition that ${\displaystyle n_{i}=n_{i+1}=0}$ ; it still minimizes the Hamming weight.

Exponentiation by squaring can be viewed as a suboptimal addition-chain exponentiation algorithm: it computes the exponent by an addition chain consisting of repeated exponent doublings (squarings) and/or incrementing exponents by one (multiplying by x) only. More generally, if one allows any previously computed exponents to be summed (by multiplying those powers of x), one can sometimes perform the exponentiation using fewer multiplications (but typically using more memory). The smallest power where this occurs is for n = 15:

${\displaystyle x^{15}=x\times (x\times [x\times x^{2}]^{2})^{2}}$  (squaring, 6 multiplies),
${\displaystyle x^{15}=x^{3}\times ([x^{3}]^{2})^{2}}$  (optimal addition chain, 5 multiplies if x³ is re-used).

In general, finding the optimal addition chain for a given exponent is a hard problem, for which no efficient algorithms are known, so optimal chains are typically used for small exponents only (e.g. in compilers where the chains for small powers have been pre-tabulated). However, there are a number of heuristic algorithms that, while not being optimal, have fewer multiplications than exponentiation by squaring at the cost of additional bookkeeping work and memory usage. Regardless, the number of multiplications never grows more slowly than Θ(log n), so these algorithms improve asymptotically upon exponentiation by squaring by only a constant factor at best.

• Modular exponentiation
• Vectorial addition chain
• Montgomery reduction
• Non-adjacent form
• Addition chain