Perform D-H Key exchange using p=73 and α = 5.  A=13 and B=61   a ≡ αA (mod p) b ≡ αB (mod p) ᴋ ≡ bA ≡ aB  (mod p)   What is the value of the key,  ᴋ ?

Use recurrence relation: T(n) = T(n – 1) + n if n > 1 T(n) = 1 if n = 1 Use the substitution method with a guess of cn². Sub.Remainder: What is the remainder after substituting in the guess? Enter an expression

NOTE: This is a multi-part question. Once an answer is submitted, you will be unable to return to this part. Let an be the number of bit strings of length n that do not contain three consecutive 0s. Identify the initial conditions for the recurrence relation in the previous question. (You must provide an answer before moving to the next part.) a0 = 1, a1 = 2, and a2 = 4 a0 = 1, a1 = 2, and a2 = 3 a0 = 2, a1 = 1, and a2 = 4 a0 = 2, a1 = 1, and a2 = 3

Please generate the 16 subkeys of this key 0x011f011f010e010e (the 8 parity bits are included) by using DES subkey schedule algorithm and demonstrate that this key is a semi-weak key (i.e., there are only 2 different subkeys that can be generated by this key). Please represent the subkeys you generate in hexadecimal.