csc421 case 2
This problem provides a numerical example of encryption using a one-round version of DES. We start with the same bit pattern for the key K and the plaintext (the key and the plaintext are the same), namely:

The plaintext and key is:

0000 0001 0010 0011 0100 0101 0110 0111

1000 1001 1010 1011 1100 1101 1110 1111

Derive K1, the first-round subkey. Please show step-by-step how you derive K1 (HINT: First, pass the 64-bit input through PC-1 to produce a 56-bit result. Then perform a left circular shift separately on the two 28-bit halves, C0 and D0. Finally, pass the 56-bit result through PC-2 to produce the 48-bit K1).
Derive L0 and R0 (HINT: follow the Step 2: Encode each 64-bit block of data).