In cryptography, differential equations of addition (DEA) are one of the most basic equations related to differential cryptanalysis that mix additions over two different groups (e.g. addition modulo 232 and addition over GF(2)) and where input and output differences are expressed as XORs.

## Examples

Differential equations of addition (DEA) are of the following form:

${\displaystyle (x+y)\oplus ((x\oplus a)+(y\oplus b))=c}$

where ${\displaystyle x}$ and ${\displaystyle y}$ are ${\displaystyle n}$-bit unknown variables and ${\displaystyle a}$, ${\displaystyle b}$ and ${\displaystyle c}$ are known variables. The symbols ${\displaystyle +}$ and ${\displaystyle \oplus }$ denote addition modulo ${\displaystyle 2^{n}}$ and bitwise exclusive-or respectively. The above equation is denoted by ${\displaystyle (a,b,c)}$.

Let a set

${\displaystyle S=\{(a_{i},b_{i},c_{i})|i

for integer ${\displaystyle i}$ denote a system of ${\displaystyle k(n)}$ DEA where ${\displaystyle k(n)}$ is a polynomial in ${\displaystyle n}$. It has been proved that the satisfiability of an arbitrary set of DEA is in the complexity class P when a brute force search requires an exponential time.

In 2013, some properties of a special form of DEA were reported by Chengqing Li et al., where ${\displaystyle a=0}$ and ${\displaystyle y}$ is assumed known. Essentially, the special DEA can be represented as ${\displaystyle (x\dotplus \alpha )\oplus (x\dotplus \beta )=c}$. Based on the found properties, an algorithm for deriving ${\displaystyle x}$ was proposed and analyzed.[1]

## Applications

Solution to an arbitrary set of DEA (either in batch and or in adaptive query model) was due to Souradyuti Paul and Bart Preneel. The solution techniques have been used to attack the stream cipher Helix.