CSIS 4481: Problem Set 6: AES 1. AES round constants. The key expansion step of AES requires computing "round constants", r(i)-0000001044 where the computation is in GF(28) That is, the r(i) are poly omiaismod X8 + X4 + 3tX +1 ln other words, (i) X04)4 mod X+X+X3+X+1. Compute the following r). HINT: parts a through h should require minimal (if any) computation on your part, while parts i and j will require modulo reducing a polynomial. Feel free to compute your solutions in any of the following: as polynomials, in the binary reprysentation of the polynomial, or in 1. However, please express your answers in either binary or hexadecimal for full credit. a. r(4)- b. r(8) c. r(12) d, r(16) = e. r(20)- f. r(24) g, r(28) = h. r(32) i. r(36) J (40)