Question: A symmetric cipher is used to convert a 3-bit plaintext into a 3-bit ciphertext. Suppose it follows the below mapping: 000 010 100 000 001
A symmetric cipher is used to convert a 3-bit plaintext into a 3-bit ciphertext. Suppose it follows the below mapping:
| 000 | 010 | 100 | 000 |
| 001 | 101 | 101 | 111 |
| 010 | 110 | 110 | 011 |
| 011 | 001 | 111 | 100 |
What is the key used in this cipher?
How many possible keys can be used in this cipher?
What is the ciphertext of input 100111000111110001?
How can public-key encryption be used to distribute a secret key? What is the benefit of doing this?
In the ECB mode of operation, if there is an error in a block of the transmitted ciphertext, only the corresponding plaintext block is affected. However, in the CBC mode, the error propagates.
Suppose there is a bit error in the transmitted ciphertext C1. How many plaintext blocks will be affected during decryption?
Suppose there is a bit error in the source version of P1. How many ciphertext blocks does this error propagate through? How would this affect the plaintext blocks decrypted at the receiver end?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
