Alice and Bob use the Diffie-Hellman to create two keys k1 and k2. In generating k1, Alice selects a random number x and computes SA = g^x mod p. Bob selects a random number y and computes SB = g^y mod p. Alice and Bob exchange SA and SB, and k1 = g^xy mod p. In generating k2. Alice chooses another random number x but Bob still uses the same random number y. Suppose an eavesdropper knows that x and x differ each other by t (i.e., either x-x = t or x-x=t). Given the knowledge of k1 and a pair of plaintext M and ciphertext C encrypted by k2, can the eavesdropper find out k2?