Parity-based concurrent error detection of substitution-permutation network block ciphers
Ramesh Karri, Grigori Kuznetsov, Michael Göessel · 2003
Abstract. Deliberate injection of faults into cryptographic devices is an effec-tive cryptanalysis technique against symmetric and asymmetric encryption al-gorithms. In this paper we will describe parity code based concurrent error de-tection (CED) approach against such attacks in substitution-permutation net-work (SPN) symmetric block ciphers [22]. The basic idea compares a carefully modified parity of the input plain text with that of the output cipher text result-ing in a simple CED circuitry. An analysis of the SPN symmetric block ciphers reveals that on one hand, permutation of the round outputs does not alter the parity from its input to its output. On the other hand, exclusive-or with the round key and the non-linear substitution function (s-box) modify the parity from their inputs to their outputs. In order to change the parity of the inputs into the parity of outputs of an SPN encryption, we exclusive-or the parity of the SPN round function output with the parity of the round key. We also add to all s-boxes an additional 1-bit binary function that implements the combined parity of the inputs and outputs to the s-box for all its (input, output) pairs. These two modifications are used only by the CED circuitry and do not impact the SPN encryption or decryption. The proposed CED approach is demonstrated on a 16-input, 16-output SPN symmetric block cipher from [1]. 1.