Cryptography

Exercise 2.3: (CLO2.3) [40 marks] Assume we use a 3 x 3-bit key of K = [6 4 5]. 1. Find the initial state victor S [] and Temporary T || victor. 2. Trace the first step of RC4 which is a Key Scheduling Algorithm (KSA) to find the initial permutation S [] vector