New Data Seal has the structure shown in figure below. Consider

a scenario with n $=4$ and r $=2$ rounds. Messages are of length $2$n$=8$ bits. Calculate

the output for the following construct. The design parameters are giben below:

So: perform bitwise complement.

Si: be the identity.

Suppose the key k is a mapping k: $\{0,1)2->\{0,1)?$ is defined by

consider an input message m $=$ m$0,$m$1)=(1001,0101)$ and m$2=$ mo @ f$($mi$).$

Calculate the final encrypted message at the end of $2$ rounds.

Permutation Box: writes the bits in reverse order

k$(00)=11$

k$(10)=10$

k$(01)=01$

k$(11)=00$