1. (10 pts.) Suppose you have a language with only 3 letters: A, B, and C, which occur with frequencies 0.7, 0.2, and 0.1, respe
ctively. The following ciphertext was encrypted by the Vigen`ere method: BABABCBCAC. Assume that the key length is either 1, 2, or 3. Find the most likely key length and determine the most likely key using the method from class. Solution: We compare BABABCBCAC with its shifts by 1, 2, and 3, looking for overlaps. There are no overlaps for a shift of 1 or 3, but there are 6 overlaps for a shift of 2. Thus we expect the key length to be 2. Looking at every other letter, we see BBBBA and AACCC for the letters in even and odd positions, respectively. Due to the overwhelming frequency of the letter A in the language, we can reasonably assume that B decrypts to to A in the first sequence and C decrypts to A in the second. This gives us the key BC.
1 answer:
You might be interested in
9514 1404 393
Answer:
(b) (-5, 1)
(c) (5, -7)
(d) (9, -2)
Step-by-step explanation:
The coordinate differences between the given points are ...
(4, 2) -(0, -3) = (4, 5)
The length of the line segment between the points is √(4² +5²) = √41, so this is the side of the square, not a diagonal.
The other four points that could be corners of the square are these same distances, but at right angles. To get points at right angles, the distance values can be swapped, and one of them negated.
Two of the points could be ...
(4, 2) ± (5, -4) = (9, -2) or (-1, 6)
and the other two could be ...
(0, -3) ± (5, -4) = (5, -7) or (-5, 1)
