Hill cipher - two plaintext pairs encrypt to same ciphertext

  • Thread starter Thread starter LANS
  • Start date Start date
  • Tags Tags
    Hill
LANS
Messages
24
Reaction score
0

Homework Statement



Given the following key, find two plaintext pairs that encrypt to the same ciphertext.

\begin{pmatrix}<br /> 9 &amp; 5 \\<br /> 7 &amp; 3 \\<br /> \end{pmatrix} (mod \ 26)<br />

Homework Equations



The Attempt at a Solution



Let the two plaintext pairs be (a, b) and (c, d). Let the ciphertext be (X, Y)

9a + 7b = X mod 26
9c + 7d = X mod 26
5a +3b = Y mod 26
5c + 3d = Y mod 26


I'm not sure where to go from here. Any help would be greatly appreciated.
 
Physics news on Phys.org
You can add and subtract equations, and multiply by factors, in the usual way. The thing you have to be careful with is division. You can divide by any number that's prime to the base, 26, but it can be tricky working out the answer. E.g. 5/3 will be 19, because 5 = 5+2*26 = 57 (mod 26).
You can also cancel common factors that are shared with the base provided you cancel out in the base too:
4a + 6b = 8c (mod 26) implies
2a + 3b = 4c (mod 13)
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top