Question: We consider a double encryption of a private-key algorithm in order to increase the security such that: y = e2(el (M)). Assume the following
We consider a double encryption of a private-key algorithm in order to increase the security such that: y = e2(el (M)). Assume the following two ciphers are given: el(x) = al.x + bl e2(z) =a2.z + b2 where x and z represent the input messages, al, a2, b1 and b2 are the coefficients. Show that there is a single cipher e3(M) : a3.M+ b3 which performs exactly the same encryption (and decryption) as the combination e2(e1(M)).
Step by Step Solution
There are 3 Steps involved in it
Certainly Lets demonstrate that there exists a single c... View full answer
Get step-by-step solutions from verified subject matter experts
