The AES mix column function is performed with a pre-definedmatrix with lookup tables (Galois multiplication table), can I getan explanation on the second question..
"Apply the same idea used above, explain why the bytesubstitution, shift row and mix column can be combined together andimplemented as a simple look up table operation. And then the wholeAES is implemented by look up table and few XORs?"
Example input state:
B1 | B5 | B9 | B13 |
B2 | B6 | B10 | B14 |
B3 | B7 | B11 | B15 |
B4 | B8 | B12 | B16 |