Bob is using the one-time-pad to encrypt a message he sends to Alice.

The message is either 0 = Let's meet at 2. or 1 = Let's meet at 5.

Note that each of these messages has 16 characters in it. Bob converts his message to bytes using ASCII (or UTF-8) encoding with one byte per character, to get 128 bits. He then encrypts the message with the secret key that only he and Alice know. An attacker Marlow intercepts the ciphertext (think of Marlow as being a router between Bob and Alice). Because the one-time pad is perfectly secret, Marlow cannot understand the message. But, unlike the attacker we discussed in class, Marlow has an additional power: he can modify the ciphertext to get some and then send to Alice. Marlows goal is to get Alice to show up to the meeting at the wrong time.

Show how, without knowing whether Bob sent 0 and 1, Marlow can ensure that Alice decrypts to the other message.