a. Let X^' be the bitwise complement of X. Prove that if the complement of the plaintext block is taken and the complement of an encryption key is taken, then the result of DES encryption with these values is the complement of the original ciphertext. That is, If Y =E(K, X) Then Y^' =E(K^', X^') b. It has been said that a brute-force attack on DES requires searching a key space of 2^56 keys. Does the result of part (a) change that? | Numerade

Bitwise One's Complement Operator in C ( ~ ) with ex Programs

Java - Convert an integer into binary representation