4. Compute in AES field GF(23): where the irreducible polynomial is Px)-*+x*+x +x +1. Note that Table 4.2 contains a list of all multiplicative inverses for this field. 5. We consider AES with 128-bit block length and 128-bit key length. What is the output of the first round of AES encryption if the plaintext x consists of sixteen (68)hex (i.e. 01101000 01101000 bit string) and the AES key consists of sixteen (AAhexi.e., 10101010... 10101010 bit string). You can write your final results in a rectangular matrix format Hints: you'll have to use AES-128 key schedule to get the subkeys ko and k, first. Then you can get your A matrix (16 x 16) by x ko to start your first round encryption steps ByteSub ShiftRows, MixCol, and AddSubkey (ki) 4. Compute in AES field GF(23): where the irreducible polynomial is Px)-*+x*+x +x +1. Note that Table 4.2 contains a list of all multiplicative inverses for this field. 5. We consider AES with 128-bit block length and 128-bit key length. What is the output of the first round of AES encryption if the plaintext x consists of sixteen (68)hex (i.e. 01101000 01101000 bit string) and the AES key consists of sixteen (AAhexi.e., 10101010... 10101010 bit string). You can write your final results in a rectangular matrix format Hints: you'll have to use AES-128 key schedule to get the subkeys ko and k, first. Then you can get your A matrix (16 x 16) by x ko to start your first round encryption steps ByteSub ShiftRows, MixCol, and AddSubkey (ki)