Question 1 1 pts You decide to use 2-digit hexadecimal strings for your ciphertext. That is,...

 

Transcribed Image Text:

Question 1 1 pts You decide to use 2-digit hexadecimal strings for your ciphertext. That is, each "character" will look like XX, where each X is from the set {0,1,..., 9, A, B,..., E, F}. You want to tie each plaintext character (a-z) to a set of ciphertext elements so that the relative frequency of each ciphertext element is roughly equal. How many ciphertext digraphs XX should correspond to the letter 'd'? (Round to the nearest integer.) Question 2 1 pts If you are allowed to use any 4-letter keyword, how many different Vigenre ciphers are possible? Question 3 1 pts The column of the Vigenre square headed by the letter s corresponds to an additive cipher with what key (i.e. shift)? Question 4 Use the keyword "pig" to encrypt the word "farmer" using a Vigenre square. Question 5 Decrypt the message "DWPLP " using a Vigenre cipher with keyword "rich". 1 pts 1 pts Question 1 1 pts You decide to use 2-digit hexadecimal strings for your ciphertext. That is, each "character" will look like XX, where each X is from the set {0,1,..., 9, A, B,..., E, F}. You want to tie each plaintext character (a-z) to a set of ciphertext elements so that the relative frequency of each ciphertext element is roughly equal. How many ciphertext digraphs XX should correspond to the letter 'd'? (Round to the nearest integer.) Question 2 1 pts If you are allowed to use any 4-letter keyword, how many different Vigenre ciphers are possible? Question 3 1 pts The column of the Vigenre square headed by the letter s corresponds to an additive cipher with what key (i.e. shift)? Question 4 Use the keyword "pig" to encrypt the word "farmer" using a Vigenre square. Question 5 Decrypt the message "DWPLP " using a Vigenre cipher with keyword "rich". 1 pts 1 pts

Answer rating: 100% (QA)

Question 1 To determine the number of ciphertext digraphs XX that should correspond to the letter d ... View the full answer