Consider the following encryption scheme to provide confidentiality. A wants to send a message M to B. A calculates X, the ASCII representation of today's date. A then XORs M with X to get the ciphertext C. when B receives C, he XORs C with X to get M. you can assume that the number of bits in M is no more than the number of bits in X. Is this a good scheme?

i. Give a YES/ NO answer.

ii. If you said NO, explain your answer i.e. explain what you think is the single biggest weakness of the scheme.

Answer rating: 100% (QA)

i NO ii The biggest weakness of the scheme is that X the key is not random data ASC... View the full answer