Week 11 Flashcards
1
Q
Given probability distributions on the message space and keyspace of a cipher, compute the probabilities of each possible ciphertext
A
2
Q
Given probability distributions on the message space and keyspace of a cipher, compute the conditional probability Pr(m | c) for any message m and ciphertext c
A
3
Q
Define perfect secrecy
A
4
Q
Determine whether a given cipher has perfect secrecy
A
5
Q
Prove that a cipher with fewer keys than messages does not have perfect secrecy
A
6
Q
Appreciate that the Vernam Cipher has perfect secrecy
A
7
Q
Discuss some of the practical drawbacks of ciphers with perfect secrecy
A
8
Q
Appreciate that modern symmetric encryption schemes can be classified as stream ciphers or block ciphers
A
