Consider a system in which DES is used to encrypt messages in which the first three plaintext Bytes are known by the attacker. How many encrypted messages is it necessary to intercept in order to be reasonably sure of identifying the key used for encryption?
I thought about this, but I am not sure:
The probability that plaintext starts with the 3 known bytes is favorable cases/total cases so:
$64$ total block bits - $24$ fixed bits ($3$ bytes) $= 40$... so $2^{40} / 2^{64} = 2^{-24}$ is the probability
If I multiply this probability by the number of keys, I get the expected value of the number of keys which gives me the first 3 bytes known, so the false positives.
$$2^{56} * 2^{-24} = 2^{32}$$
So the attacker, when he tries to decrypt, he'll find 2^32 different plaintexts with the 3 known bytes.
The attacker intercepts a second packet and redoes the multiplication:
$2^{32} * 2^{-24} = 2^8$
Another time and he'll find the key!
Is this right?