-2

In general, we execute key-mixing, substitution and permutation sequentially in a single round in a n-round SPN, but if we execute n-round key-mixing firstly, n-round substitution secondly and n-round permutation finally, how is the security of this modified SPN?

Biv
  • 9,979
  • 2
  • 39
  • 67
CryptoLover
  • 932
  • 1
  • 6
  • 19

1 Answers1

2

I think this would effectively make your cipher a single round.

Key mixing is usually an XOR operation of the round key on the current state. XORing all of the round keys at once is effectively only xoring a single key.

If you have an $n\times n$ bit s-box $s(x)$ (e.g. Rijndael's sbox), then $s(s(x))$ is just another sbox which can be expressed as a lookup table.

The same logic applies to the permutation. If you have a permutation $p(x)$ then $p(p(x))$ is itself a permutation.

user13741
  • 2,627
  • 11
  • 16