(b) Let P-C-K denote respectively the plaintext space- ciphertext spac.pdf
0 likes18 views
The document discusses a cryptosystem defined by its plaintext space (p), ciphertext space (c), and key space (k). It assumes that all spaces are finite and that the cryptosystem is perfectly secure with non-zero probabilities for all ciphertexts. The goal is to prove the inequalities relating the sizes of these spaces: k ≥ c ≥ p.
1 of 1
Download to read offline
(b) Let P-C-K denote respectively the plaintext space- ciphertext spac.pdf
- 1. (b) Let P , C , K denote respectively the plaintext space, ciphertext space and key space of a given cryptosystrem. Assuming that each of these spaces is finite, that the cryptosystem is perfectly secure and that every c C has non-zero probability of occuring, prove the inequalities K C P