Suppose that the massage is M = 101010010101 has length N=12. A simple encryption algorithm follows...

 

Transcribed Image Text:

Suppose that the massage is M = 101010010101 has length N=12. A simple encryption algorithm follows two steps. In the first step it uses the encryption k = 010010 and in the second step the key k = 101101 as: a. b. C. d. Splits the data into Left and Right, each of length N/2 as: M = Lo ll Ro. Evaluates the functions: L= R XOR K and R-L XOR k and L-L XOR K and R= R XOR K, Transmits the encrypted message: Me = L || R. Write the encrypted message. Is this a valid encryption algorithm? Is the above algorithm symmetric (reversible)? Justify your answer. Suppose that the massage is M = 101010010101 has length N=12. A simple encryption algorithm follows two steps. In the first step it uses the encryption k = 010010 and in the second step the key k = 101101 as: a. b. C. d. Splits the data into Left and Right, each of length N/2 as: M = Lo ll Ro. Evaluates the functions: L= R XOR K and R-L XOR k and L-L XOR K and R= R XOR K, Transmits the encrypted message: Me = L || R. Write the encrypted message. Is this a valid encryption algorithm? Is the above algorithm symmetric (reversible)? Justify your answer.

Answer rating: 100% (QA)

To encrypt the message M101010010101 using the provided algorithm lets follow the steps Split the da... View the full answer