Use this problem as a numerical example of encryption using a one-round version of DES. Lets assume that both the key K and the plaintext are using the same bit string as follows: In hexadecimal form: 01 23 45 67 89 AB CD EF In binary form: 00000001 00100011 01000101 01100111 10001001 10101011 11001101 11101111

a) Derive round key K1 by using key scheduling algorithm for the first round (cycle).

b) Derive L0 and R0 from IP (initial permutation