(Requires knowledge of probability; see Chapter 10.) For a one-time pad with an n-bit key, we have Prove that the probability that the ciphertext is a particular c ∈ {0, 1} n is precisely 1/2n for...

(Requires knowledge of probability; see Chapter 10.) For a one-time pad with an n-bit key, we have

Prove that the probability that the ciphertext is a particular c ∈ {0, 1} n is precisely 1/2n for any distribution over plaintext messages.