The question asks about the impact of a single corrupted ciphertext block on the plaintext when using the Cipher Block Chaining (CBC) mode of the Advanced Encryption Standard (AES). The message consists of 50 AES blocks, and ciphertext block number 45 is corrupted during transmission.
In CBC mode, each ciphertext block is dependent on the previous plaintext block and the current plaintext block during encryption. However, during decryption, the process is different and involves the previous ciphertext block:
Crucially, the decryption of a plaintext block $P_i$ depends on the correct decryption of $C_i$ and the integrity of the previous ciphertext block $C_{i-1}$. It does not directly depend on the previously decrypted plaintext block ($P_{i-1}$).
Let's trace the effect of the corrupted ciphertext block $C_{45}$ (which Bob receives as $C'_{45}$) on the decrypted plaintext blocks:
A single corrupted ciphertext block in CBC mode affects the decryption of that specific block and the immediately following block. In this case, the corruption of ciphertext block 45 leads to the corruption of both plaintext block 45 and plaintext block 46.
Therefore, the total number of corrupted plaintext blocks is 2.
| 1. | DES | a. | 128-256 bits |
| 2. | Rj indeal | b. | 1-448 bits |
| 3. | RC4 | c. | 56 bits |
| 4. | Blowfish | d. | 1-2048 bits |
In the RSA public key cryptosystem, the private and public keys are $(e, n)$ and $(d, n)$ respectively, where $n = p \times q$ and $p$ and $q$ are large primes. Besides, $n$ is public and $p$ and $q$ are private. Let M be an integer such that $0 <M< n$ and $\phi(n) = (p-1)(q - 1)$. now consider the following equations.
I. M’ =\( M^e\) mod n M =\( (M')^d\) mod n
II. ed ≡1 mod n
III. ed ≡1 mod f(n)
IV. M’ = \(M^e \)mod f(n)
M = \( (M')^d\) mod
Which of the above equations correctly represent RSA cryptosystem?
| 1. | Brute-Force Attack | a. | Change of keys |
| 2. | Statistical Attack | b. | Number of possible keys are large |
| 3. | Pattern Attack | c. | Hide the characteristics of the language |
| 4. | Known - Plain Text Attack | d. | Ciphertext is as random as possible |