In order to answer this question, you much understand the properties of finite fields. This is an aspect of cryptography.

In Simplified AES, for function MC we showed an easier approach by showing what each column is transformed to, using only XOR of bits (shown in page 21 of lecture notes). We know that MC-1 is multiplying by c(z)-1 = xz + (x3 + 1) in F16[2]/(22 + 1). It would be nicer to have this in a similar form as the table for MC. So multiply (box3 + b1x2 + b2x+63)2 + (6423 + b502 +b6x +b7) with xz + (x3 +1) in F16[2]/(22 +1) by hand to show what bob.b2b3.. goes to b4b5beby Boss In Simplified AES, for function MC we showed an easier approach by showing what each column is transformed to, using only XOR of bits (shown in page 21 of lecture notes). We know that MC-1 is multiplying by c(z)-1 = xz + (x3 + 1) in F16[2]/(22 + 1). It would be nicer to have this in a similar form as the table for MC. So multiply (box3 + b1x2 + b2x+63)2 + (6423 + b502 +b6x +b7) with xz + (x3 +1) in F16[2]/(22 +1) by hand to show what bob.b2b3.. goes to b4b5beby Boss