Problem 2: DESX and Meet-in-the-middle Attack Recall DESX from the lecture slides, a variant of DES. DESX: C k-e Enc(k2, (ki P), where ki is n-bit inner key, k2 is t-bit encryption key, k3 is n-bit outer key, P is the plaintext and C is the ciphertext with n bits each. Consider two reduced” variants of this encryption scheme 2a DESXi: C-k3田Ene(k2. (0田P), it is the same as DESX except that it skips inner key by XOR-ing
OR
OR