A Feistel cipher/Feistel network is a class of block cipher which comprises several identical rounds, each round constructed from a function and a a swap.

The input block is split in the middle to give to equal sized sub-blocks.
Let us call the initial left-hand side sub-block `L`

,
and the initial right-hand side sub-block _{0}`R`

.
Let the function _{0}`F`

be the round function which uses
the _{ki}`i`

^{th} round key, `k`

.
These round keys are generated by the key schedule which is unspecified.
If we have _{i}`r`

rounds, then for `1≤i<r`

` ````
L
```_{i} = R_{i-1}
R_{i} = L_{i-1}⊕F_{ki}(R_{i-1})

and for `i=r`

` ````
L
```_{r} = R_{r-1}⊕F_{kr}(L_{r-1})
R_{r} = L_{r-1}

The figure below shows a Feistel network with four rounds being used to encrypt a plaintext message.

The process of decryption is identical to the one for encryption as long as the round keys are used in reverse order. The figure below shows decryption.

When compared to a substitution/permutation network we see that the Feistel network has an advantage in that it does not require that the round function have an inverse.

L. R. Knudsen, M. J. B. Robshaw, *The Block Cipher Companion.* Springer, 2011.

Copyright © 2014 Barry Watson. All rights reserved.