Information Theory and Perfect Secrecy
Theoretical Security
Practical Security
One Time Pad as an example of Perfect Secrecy
Let |K| = |M| = |C|
Let K be completely random
Let R be R = K ( XOR) M be the encryptor
Then for all choices of M and K they are statistically independent
Previous slide
Next slide
Back to first slide
View graphic version