XOR
function, with the key
10001011
2. Give the resulting ciphertext. Now
apply the key and XOR
function to the ciphertext, and
verify that the original bytes are recovered.
01001011 01000101 01000111
XOR
-based monoalpabetic
cryptosystem described in the lecture,
and in the previous question? 107
keys tried per second?
What about for a cryptosystem with a key size of 128 bits?