Piling-up lemma

In cryptanalysis, the piling-up lemma is a principle used in linear cryptanalysis to construct linear approximations to the action of block ciphers. It was introduced by Mitsuru Matsui (1993) as an analytical tool for linear cryptanalysis. The lemma states that the bias (deviation of the expected value from 1/2) of a linear Boolean function (XOR-clause) of independent binary random variables is related to the product of the input biases:


 * $$\epsilon(X_1\oplus X_2\oplus\cdots\oplus X_n)=2^{n-1}\prod_{i=1}^n \epsilon(X_i)$$

or


 * $$I(X_1\oplus X_2\oplus\cdots\oplus X_n ) =\prod_{i=1}^n I(X_i)$$

where $$\epsilon \in [-\tfrac{1}{2}, \tfrac{1}{2}]$$ is the bias (towards zero ) and $$I \in [-1, 1]$$ the imbalance:


 * $$\epsilon(X) = P(X=0) - \frac{1}{2}$$
 * $$I(X) = P(X=0) - P(X=1) = 2 \epsilon(X)$$.

Conversely, if the lemma does not hold, then the input variables are not independent.

Interpretation
The lemma implies that XOR-ing independent binary variables always reduces the bias (or at least does not increase it); moreover, the output is unbiased if and only if there is at least one unbiased input variable.

Note that for two variables the quantity $$I(X \oplus Y)$$ is a correlation measure of $$X$$ and $$Y$$, equal to $$P(X=Y)-P(X\ne Y)$$; $$I(X)$$ can be interpreted as the correlation of $$X$$ with $$0$$.

Expected value formulation
The piling-up lemma can be expressed more naturally when the random variables take values in $$\{-1,1\}$$. If we introduce variables $$\chi_i = 1 - 2X_i = (-1)^{X_i}$$ (mapping 0 to 1 and 1 to -1) then, by inspection, the XOR-operation transforms to a product:


 * $$\chi_1\chi_2\cdots\chi_n = 1 - 2(X_1 \oplus X_2\oplus\cdots\oplus X_n) = (-1)^{X_1 \oplus X_2\oplus\cdots\oplus X_n}$$

and since the expected values are the imbalances, $$E(\chi_i)=I(X_i)$$, the lemma now states:


 * $$E\left(\prod_{i=1}^n \chi_i \right)=\prod_{i=1}^nE(\chi_i)$$

which is a known property of the expected value for independent variables.

For dependent variables the above formulation gains a (positive or negative) covariance term, thus the lemma does not hold. In fact, since two Bernoulli variables are independent if and only if they are uncorrelated (i.e. have zero covariance; see uncorrelatedness), we have the converse of the piling up lemma: if it does not hold, the variables are not independent (uncorrelated).

Boolean derivation
The piling-up lemma allows the cryptanalyst to determine the probability that the equality:


 * $$X_1\oplus X_2\oplus\cdots\oplus X_n=0$$

holds, where the X's are binary variables (that is, bits: either 0 or 1).

Let P(A) denote "the probability that A is true". If it equals one, A is certain to happen, and if it equals zero, A cannot happen. First of all, we consider the piling-up lemma for two binary variables, where $$P(X_1 = 0)=p_1$$ and $$P(X_2 = 0)=p_2$$.

Now, we consider:


 * $$P(X_1 \oplus X_2 = 0)$$

Due to the properties of the xor operation, this is equivalent to


 * $$P(X_1=X_2)$$

X1 = X2 = 0 and X1 = X2 = 1 are mutually exclusive events, so we can say


 * $$P(X_1=X_2)=P(X_1=X_2=0) + P(X_1=X_2=1)=P(X_1=0, X_2=0) + P(X_1=1, X_2=1)$$

Now, we must make the central assumption of the piling-up lemma: the binary variables we are dealing with are independent; that is, the state of one has no effect on the state of any of the others. Thus we can expand the probability function as follows:




 * $$P(X_1 \oplus X_2 = 0)$$
 * $$=P(X_1=0)P(X_2=0)+P(X_1=1)P(X_2=1)$$
 * $$=p_1p_2 + (1-p_1)(1-p_2)$$
 * $$=p_1p_2 + (1-p_1-p_2+p_1p_2)$$
 * $$=2p_1p_2-p_1-p_2+1$$
 * }
 * $$=p_1p_2 + (1-p_1-p_2+p_1p_2)$$
 * $$=2p_1p_2-p_1-p_2+1$$
 * }
 * $$=2p_1p_2-p_1-p_2+1$$
 * }
 * $$=2p_1p_2-p_1-p_2+1$$
 * }

Now we express the probabilities p1 and p2 as $1⁄2$ + ε1 and $1⁄2$ + ε2, where the ε's are the probability biases &mdash; the amount the probability deviates from $1⁄2$.




 * $$P(X_1 \oplus X_2 = 0)$$
 * $$=2(1/2+\epsilon_1)(1/2+\epsilon_2)-(1/2+\epsilon_1)-(1/2+\epsilon_2)+1$$
 * $$=1/2+\epsilon_1+\epsilon_2+2\epsilon_1\epsilon_2-1/2-\epsilon_1-1/2-\epsilon_2+1$$
 * $$=1/2+2\epsilon_1\epsilon_2$$
 * }
 * $$=1/2+\epsilon_1+\epsilon_2+2\epsilon_1\epsilon_2-1/2-\epsilon_1-1/2-\epsilon_2+1$$
 * $$=1/2+2\epsilon_1\epsilon_2$$
 * }
 * $$=1/2+2\epsilon_1\epsilon_2$$
 * }

Thus the probability bias ε1,2 for the XOR sum above is 2ε1ε2.

This formula can be extended to more X's as follows:


 * $$P(X_1\oplus X_2\oplus\cdots\oplus X_n=0)=1/2+2^{n-1}\prod_{i=1}^n \epsilon_i$$

Note that if any of the ε's is zero; that is, one of the binary variables is unbiased, the entire probability function will be unbiased &mdash; equal to $1⁄2$.

A related slightly different definition of the bias is $$ \epsilon_i = P(X_i=1) - P(X_i=0),$$ in fact minus two times the previous value. The advantage is that now with


 * $$\varepsilon_{total}= P(X_1\oplus X_2\oplus\cdots\oplus X_n=1)- P(X_1\oplus X_2\oplus\cdots\oplus X_n=0)$$

we have


 * $$\varepsilon_{total}=(-1)^{n+1}\prod_{i=1}^n \varepsilon_i,$$

adding random variables amounts to multiplying their (2nd definition) biases.

Practice
In practice, the Xs are approximations to the S-boxes (substitution components) of block ciphers. Typically, X values are inputs to the S-box and Y values are the corresponding outputs. By simply looking at the S-boxes, the cryptanalyst can tell what the probability biases are. The trick is to find combinations of input and output values that have probabilities of zero or one. The closer the approximation is to zero or one, the more helpful the approximation is in linear cryptanalysis.

However, in practice, the binary variables are not independent, as is assumed in the derivation of the piling-up lemma. This consideration has to be kept in mind when applying the lemma; it is not an automatic cryptanalysis formula.