lice and Bob use the Diffie-Hellmanprotocol to create two keys k1 and k2. In generatingk1, Alice selects a random number x and computesSA = g^xmod p. Bob selects a random number y and computes SB = g^ymod p. Alice and Bob exchange SAand SB, andk1 = g^xymod p.In generatingk2. Alice chooses another random number x1 but Bob still uses the same random number y. Supposean eavesdropperknows that x and x1 differ each other by t (i.e., ||x-x1|| = t).Given the knowledge of k1and a pair of plaintext M and ciphertext C encrypted by k2, can the eavesdropperfind out k2?