|
|
|
|
Substitution-permutation network
|
| |
|
| |
In cryptography, an SP-network, or substitution-permutation network (SPN), is a series of linked mathematical operations used in block cipher algorithms such as AES.
These networks consist of S-boxes and P-boxes that transform blocks of input bits into output bits. It is common for these transformations to be operations that are efficient to perform in hardware, such as exclusive or (XOR) and bitwise rotation.
S-boxes substitute or transform input bits into output bits.

Discussion
Ask a question about 'Substitution-permutation network'
Start a new discussion about 'Substitution-permutation network'
Answer questions from other users
|
Encyclopedia
In cryptography, an SP-network, or substitution-permutation network (SPN), is a series of linked mathematical operations used in block cipher algorithms such as AES.
These networks consist of S-boxes and P-boxes that transform blocks of input bits into output bits. It is common for these transformations to be operations that are efficient to perform in hardware, such as exclusive or (XOR) and bitwise rotation.
S-boxes substitute or transform input bits into output bits. A good S-box will have the property that changing one input bit will change about half of the output bits. It will also have the property that each output bit will depend on every input bit. P-boxes take the S-box outputs of one round, permute or transpose bits, and feed them into the S-box inputs of the next round. In addition, at each round the key is combined using some group operation, typically XOR.
While a single typical S-box adds only a limited amount of diffusion and a single typical P-box only adds a limited amount of confusion, a well-designed SP network has enough rounds that changing any input bit changes every output bit of the entire message with equal probability.
For a given amount of confusion and diffusion, a SP network has more parallelism and so can be computed faster on modern CPUs than a Feistel network.
See also
|
| |
|
|