Assume CBC-mode encryption using an 8-byte (64-bit) block cipher. Say a sender encrypts the 8-byte message “sendme$2” (encoded in ASCII), resulting in ciphertext 0xFF 09 28 30 8C 93 81 06 39 D0 81 5A 07 79 17 43. Which of the following ciphertexts will decrypt to the message “sendme$4” ?

Which of the following is a generator of Z*11?

What is ϕ(77)?

Which of the following is a setting in which a pseudorandom generator could be applied?

Which of the following would NOT be a secure way for a receiver to distribute her key for a public-key encryption scheme? (Assume a passive, eavesdropping attacker here.)

Which of the following BEST describes the security offered by the Diffie-Hellman key-exchange protocol (assuming the DDH problem is hard)?

What is the size of key space |K| for a byte-wise shift cipher, considering the message space as English alphabets, and encryption algorithm as Enc​(m)=(m⊕k)?

Let G be a function mapping n-bit inputs to 2n-bit outputs. Which of the following is true of the pseudo one-time pad encryption scheme based on G?

Define the generator G by G(x) = x | x. (G maps inputs of length n to outputs of length 2n). Which of the following algorithms A distinguishes the output of G from uniform?

Three ASCII messages containing English letters and spaces only are encrypted using the one-time pad and the same key. The 10th byte of the first ciphertext is observed to be 0x66, the 10th byte of the second ciphertext is observed to be 0x32, and the 10th byte of the third ciphertext is observed to be 0x23. Let m1 (resp., m2, m3) denote the 10th ASCII character in the first (resp., second, third) message. What is the most you can conclude about m1, m2, and m3?