Question: In a symmetric encryption system, ciphertext is calculated as follows: C=E[K1, E[K2, P]]. In other words, in order to encrypt the message P, the encryption

In a symmetric encryption system, ciphertext is calculated as follows: C=E[K1, E[K2, P]]. In other words, in order to encrypt the message P, the encryption algorithm is being run twice with secret keys K1 and K2, respectively. Given a (P, C) pair, in order to break the system (finding K1 and K2) how many operations must be performed? Both keys are n-bit in length. Please find the optimal answer. You can ignore all other writing and comparison operations. Just concantrate on the number of encryption and/or decryption operations
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
