1. Implementing a Feistel Cipher (70 points)
Step 1: The function takes as input 8 bits and the 4-bit keyk.
Step 2: The binary is divided into two halves (L0 and R0)
Step 3: The function computes L1=R0 and R1=L0 Å F(R0, k), whereF(R0, k) = 2´�! " mod 24
Step 4: The function performs a swapping of L1 and R1, thenoutputs R1|| L1
2. Combing with Assignment 1 (20 points) Improve yourimplementation for 1 by using your Text Converter, so it can handlea string from a user and output a string.
3. Make some test codes to show the correctness of yourimplementation (10 points)
1. Implementing a Feistel Cipher (70 points) Step 1: The function takes as input 8 bits and the 4-bit key k. Step 2: The
-
- Site Admin
- Posts: 899603
- Joined: Mon Aug 02, 2021 8:13 am