Cryptography question:

Please show your work.

Problem 2-Arithmetic with the constant polynomial of MIXCOLMNs in AES, 13 marks Recall that the MIxCOLUMNS operation in AES uses the polynomial e(y)-(03)y' + (01 )y2 + (01)y + (02) , where the coefficients of c(y) are bytes written in hexadecimal (i.e. base 16) notation. Arith metic involving this polynomial requires the computation of products involving the bytes (01), (02) and (03) in the AES field GF(28). Problem 2-Arithmetic with the constant polynomial of MIXCOLMNs in AES, 13 marks Recall that the MIxCOLUMNS operation in AES uses the polynomial e(y)-(03)y' + (01 )y2 + (01)y + (02) , where the coefficients of c(y) are bytes written in hexadecimal (i.e. base 16) notation. Arith metic involving this polynomial requires the computation of products involving the bytes (01), (02) and (03) in the AES field GF(28)