Recall DESX from the lecture slides, a variant of DES. DESX: C =k3 E nc(k2 , (k1 P )), where k1 is n-bit inner key, k2 is t-bitencryption key, k3 is n-bit outer key, P is the plaintext and C isthe ciphertext with n bits each. Consider two ”reduced” variants ofthis encryption scheme.
2a DESX1: C = k3 Enc(k2, (0 P )), it is the same as DESXexcept that it skips inner key by XOR-ing input with zeros beforethe encryption step. Give an algorithm for a brute-force attack onthis block cipher, and discuss
OR
OR