Problem
Prove that the Shift Rows and In v Shift Rows transformations are permutations by doing the following:
a. Show the permutation table for Shift Rows. The table needs to have 128 entries, but since the contents of a byte do not change, the table can have only 16 entries with the assumption that each entry represents a byte.
b. Repeat Part a for In v Shift Rows transformation.
c. Using the results of Parts a and b, prove that the Shift Rows and In v Shift Rows transformations are inverses of each other.