Suppose a cryptosystem achieves perfect secrecy for a particular plaintext probability distribution. Prove that perfect secrecy is maintained for any other plaintext probability distribution.

Having trouble starting this one. Just a hint to get started would be appreciated.

I am aware that a cryptosystem is said to be perfectly secure if $P(X|Y)=P(X)$ for all $x\in\mathcal{P}, y\in\mathcal{C}$


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.