Hill Cipher Attack: Eve Can Crack Alice's Message

  • Context: MHB 
  • Thread starter Thread starter Mathick
  • Start date Start date
  • Tags Tags
    Hill
Click For Summary
SUMMARY

The discussion centers on the vulnerability of the Hill cipher, specifically a $2 \times 2$ matrix $M$, used by Alice to encrypt a message of 100 'A's. Eve can exploit her knowledge of one entry of the matrix and the fact that the plaintext consists solely of one letter to deduce both the plaintext and the complete key. The matrix must be invertible, satisfying the condition $ad-bc \not\equiv 0 \pmod{n}$, where $n$ is the number of letters in the alphabet. The participants conclude that the problem statement is incomplete, as it implies the use of a full alphabet rather than a limited set of letters.

PREREQUISITES
  • Understanding of the Hill cipher encryption method
  • Knowledge of matrix operations and invertibility
  • Familiarity with modular arithmetic
  • Basic concepts of cryptography and plaintext-ciphertext relationships
NEXT STEPS
  • Study the properties of invertible matrices in cryptography
  • Learn about the implications of using limited alphabets in encryption
  • Research common vulnerabilities in classical ciphers like the Hill cipher
  • Explore advanced cryptanalysis techniques for matrix-based ciphers
USEFUL FOR

Cryptographers, students of cryptography, and anyone interested in understanding the weaknesses of classical encryption methods, particularly the Hill cipher.

Mathick
Messages
23
Reaction score
0
Suppose that we are in the situation that Alice is using a Hill cipher consisting of a $2 \times 2$ matrix $M$ to send her message, which is $100$ ‘A’s. If Eve intercepts this message and knows that plaintext contained only one letter, and she also knows anyone of the entries of the matrix $M$, then prove that Eve can use this information to find the plaintext and the complete key.

So I tried writing a matrix $M$ as $M = \begin{bmatrix} a & b \\ c & d \\ \end{bmatrix}$ and assuming that Eve saw messages $c_1$ and $c_2$, I got

$\begin{bmatrix} a & b \\ c & d \\ \end{bmatrix} \begin{bmatrix} x \\ x \\ \end{bmatrix} = \begin{bmatrix} c_1 \\ c_2 \\ \end{bmatrix}$ which implies $x \begin{bmatrix} a + b \\ c + d \\ \end{bmatrix} = \begin{bmatrix} c_1 \\ c_2 \\ \end{bmatrix}$ where $x$ is a letter that Eve wants to find.

But I don't know how to conclude from this that she can do it. I tried assuming that, for example, she knows the entry $a$ or any other and proceed but it led me nowhere.If you could help or give me some hint, I would appreciate it very much.
 
Physics news on Phys.org
Hi Mathick,

We also have that the matrix must be invertible.
That is, $ad-bc\not\equiv 0 \pmod{\text n}$, where $n$ is the number of letters.

Either way, it seems to me that the problem statement is incomplete.
Is it possible that we only use the letters 'A' and 'B'?
Because then we can indeed prove what is requested.
 
Klaas van Aarsen said:
Hi Mathick,

We also have that the matrix must be invertible.
That is, $ad-bc\not\equiv 0 \pmod{\text n}$, where $n$ is the number of letters.

Either way, it seems to me that the problem statement is incomplete.
Is it possible that we only use the letters 'A' and 'B'?
Because then we can indeed prove the what is requested.

Hi, thanks for your reply!

That is what I thought - that this problem is incomplete. It says that we use a full alphabet (26 letters) and I also came to the conclusion that the statement can't be proven. I will try to find out where the typo is and come back.
 

Similar threads

  • · Replies 33 ·
2
Replies
33
Views
2K
  • · Replies 24 ·
Replies
24
Views
2K
Replies
8
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
Replies
2
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 12 ·
Replies
12
Views
3K
  • · Replies 2 ·
Replies
2
Views
4K
  • · Replies 8 ·
Replies
8
Views
3K
  • · Replies 1 ·
Replies
1
Views
3K