3. Galois Counter Mode (GCM) provides authentication using GHASH unit. Suppose we get the polynomial for the 128-bit hash subkey (H) as: H(x) = x27+x25 +x20 +x4+x+1. Also, as you know, the irreducible polynomial for GCM is: P(x) = x128+x?+x2+x+1. Find the polynomial representing B(x)=(M1.H+M2).H mod P(x) assuming the two 128-bit input blocks to GHASH are as follows: M = x89+x23+x10, M2= 793+x24+x10+x. B(x)=(M1.H+M2).H mod p(x) is what you have to derive in GF (2128) after reduction. This is a very simple calculation which is done in practice thousands of times for eventually deriving a tag. 3. Galois Counter Mode (GCM) provides authentication using GHASH unit. Suppose we get the polynomial for the 128-bit hash subkey (H) as: H(x) = x27+x25 +x20 +x4+x+1. Also, as you know, the irreducible polynomial for GCM is: P(x) = x128+x?+x2+x+1. Find the polynomial representing B(x)=(M1.H+M2).H mod P(x) assuming the two 128-bit input blocks to GHASH are as follows: M = x89+x23+x10, M2= 793+x24+x10+x. B(x)=(M1.H+M2).H mod p(x) is what you have to derive in GF (2128) after reduction. This is a very simple calculation which is done in practice thousands of times for eventually deriving a tag