Can someone please help me as soon as possible with both of these questions based on cryptography and AES thansk in advance both these questions are related to each other and Im not sure how to do them l.

4 The Advanced Encryption Standard (AES 120 4.11. The MixColumn transformation of AES consists of a matrix-vec cation in the field GF (28) with P(x)-+ +3+x+1. Letb (bnx1u be one of the (four) input bytes to the vector-matrix multiplication.Each in is multiplied with the constants 01, 02 and 03. Your task is to provide exacte tions for computing those three constant multiplications. We denote the result input byte equa 1. Equations for computing the 8 bits of d-01 b. 2. Equations for computing the 8 bits of d-02.b 3. Equations for computing the 8 bits of d-03.b. Note: The AES specification uses "Ol" to represent the polynomial 1, "2" to rep- resent the polynomial x, and "03" to represent x+1. 4.12. We now look at the gate (or bit) complexity of the MixColumn function, using the results from problem 4.11. We recall from the discussion of stream ciphers that a 2-input XOR gate performs a GF(2) addition. 1. How many 2-input XOR gates are required to perform one constant multiplica- tion by 01, 02 and 03, respectively, in GF(28) vector multiplication? Diffusion layer? We assume permutations require no gates. 2. What is the overall gate complexity of a hardware implementation of one matrix- 3. What is the overall gate complexity of a hardware implementation of the entire