Secure condition:-
Show that a necessary and sufficient condition for perfect security is H(C|M) = H(C) for every set of probabilities. (Homophonic keys) Prove theorem for homophonic systems.
Theorem
A necessary condition for a system to be perfectly secure is that the number of possible keys be at least as large as the number of possible messages.