Higher-order differential cryptanalysis

In cryptography, higher-order differential cryptanalysis is a generalization of differential cryptanalysis, an attack used against block ciphers. While in standard differential cryptanalysis the difference between only two texts is used, higher-order differential cryptanalysis studies the propagation of a set of differences between a larger set of texts. Xuejia Lai, in 1994, laid the groundwork by showing that differentials are a special case of the more general case of higher order derivates. ^[1] Lars Knudsen, in the same year, was able to show how the concept of higher order derivatives can be used to mount attacks on block ciphers. ^[2] These attacks can be superior to standard differential cryptanalysis. Higher-order differential cryptanalysis has notably been used to break the KN-Cipher, a cipher which had previously been proved to be immune against standard differential cryptanalysis. ^[3]

Higher-order derivatives

A block cipher which maps ${\displaystyle n}$-bit strings to ${\displaystyle n}$-bit strings can, for a fixed key, be thought of as a function ${\displaystyle f:\mathbb {F} _{2}^{n}\to \mathbb {F} _{2}^{n}}$. In standard differential cryptanalysis, one is interested in finding a pair of an input difference ${\displaystyle \alpha }$ and an output difference ${\displaystyle \beta }$ such that two input texts with difference ${\displaystyle \alpha }$ are likely to result in output texts with a difference ${\displaystyle \beta }$ i.e., that ${\displaystyle f(m\oplus \alpha )\oplus f(m)=\beta }$ is true for many ${\displaystyle m\in \mathbb {F} _{2}^{n}}$. Note that the difference used here is the XOR which is the usual case, though other definitions of difference are possible.

This motivates defining the derivative of a function ${\displaystyle f:\mathbb {F} _{2}^{n}\to \mathbb {F} _{2}^{n}}$ at a point ${\displaystyle \alpha }$ as ^[1]

${\displaystyle \Delta _{\alpha }f(x):=f(x\oplus \alpha )\oplus f(x)}$.

Using this definition, the ${\displaystyle i}$-th derivative at ${\displaystyle (\alpha _{1},\alpha _{2},\dots ,\alpha _{i})}$ can recursively be defined as ^[1]

${\displaystyle \Delta _{\alpha _{1},\alpha _{2},\dots ,\alpha _{i}}^{(i)}f(x):=\Delta _{\alpha _{i}}\left(\Delta _{\alpha _{1},\alpha _{2},\dots ,\alpha _{i-1}}^{i-1}f(x)\right)}$.

Thus for example ${\displaystyle \Delta _{\alpha _{1},\alpha _{2}}^{(2)}f(x)=f(x)\oplus f(x\oplus \alpha _{1})\oplus f(x\oplus \alpha _{2})\oplus f(x\oplus \alpha _{1}\oplus \alpha _{2})}$.

Higher order derivatives as defined here have many properties in common with ordinary derivative such as the sum rule and the product rule. Importantly also, taking the derivative reduces the algebraic degree of the function.

Higher-order differential attacks

To implement an attack using higher order derivatives, knowledge about the probability distribution of the derivative of the cipher is needed. Calculating or estimating this distribution is generally a hard problem but if the cipher in question is known to have a low algebraic degree, the fact that derivatives reduce this degree can be used. For example, if a cipher (or the S-box function under analysis) is known to only have an algebraic degree of 8, any 9th order derivative must be 0.

Therefore, it is important for any cipher or S-box function in specific to have a maximal (or close to maximal) degree to defy this attack.

Cube attacks have been considered a variant of higher-order differential attacks. ^[4]

Limitations of Higher-order differential attacks

Works for small or low algebraic degree S-boxes or small S-boxes. In addition to AND and XOR operations.

See also

• Differential Cryptanalysis
• KN-Cipher
• Cube attack

References

1. Lai, Xuejia (1994). "Higher Order Derivatives and Differential Cryptanalysis". Communications and Cryptography. Vol. 276. Springer US. pp. 227–233. doi:10.1007/978-1-4615-2694-0_23. ISBN   978-1-4613-6159-6.{{cite book}}: Missing or empty |title= (help)
2. Knudsen, Lars (1994). Truncated and Higher Order Differentials (PDF/PostScript). Fast Software Encryption (FSE 1994). Springer-Verlag. pp. 196–211. Retrieved 2007-02-14.
3. Jakobsen, Thomas and Knudsen, Lars (1997). The interpolation attack on block ciphers. Fast Software Encryption. Lecture Notes in Computer Science. Vol. 1267. Springer Berlin Heidelberg. pp. 28–40. doi:10.1007/BFb0052332. ISBN   978-3-540-63247-4.
4. Daniel J. Bernstein (2009-01-14). "Why haven't cube attacks broken anything?" . Retrieved 2014-05-18.