Shannon’s Characterization of Perfect Secrecy

Theorem:

Consider cryptosystem with # keys = # possible ciphertexts = # possible plaintexts.

Then cryptosystem provides perfect secrecy if and only if every key is used with equal probability, and for every plaintext p and every ciphertext c, there is a unique key K such that

EK(p) = c

Previous slide

Next slide

Back to first slide

View graphic version