There is no solution for 4.6 in the Cyprtography and Network Security solutions. That being said I need some assistance solving this problem:

Suppose the DES F function mapped every 32-bit input R, regardless of the value of the input K, to a. 32-bit string of ones b. bitwise complement of R Hint: Use the following properties of the XOR operation: 1. What function would DES then compute? 2. What would the decryption look like? (A O B) OC = A O (B O C) A O A = 0 A O0 = A bitwise complement of A A O1 where A, B, C are n-bit strings of bits O is an n-bit string of zeros 1 is an n-bit string of one