Can any one provide the detailed process or explanation of the problem4.6?

thanks!

of a atual bit length of k is irrelevant). Thus, EL( k. [,n! m21)-EL( k. m) EL(k, rn2) for all 128-bit patterns ml, m2 Described how, with 256 chosen ciphertexts, an adversary can decrypt any ciphertext without knowledge o sary has the ability to choose a ciphertext and then obtain its decryption. Here, you have 256 plaintext/ciphertext pairs to work with and you have the ability to choose the value of the ciphertexts.) Suppose the DES F function mapped every 32-bit input R, regardless of the value f the input K to; a. 32-bit string of zero b. R Then 1. What function would DESthen compute? 2. What would the decryption look like? (A"chosen ciphertext" means that an adver cre 4.6 key Hint: Use the following properties of the XOR operation: (A0) A 1 = bitwise complement of A