Given the matrix , use a Hill cipher to decipher the message using modulo 26, where and enter the result as a string of integers.
What does the deciphered message state?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Note: det ( A ) = 3 and g cd ( 3 , 2 6 ) = 1 , so for each block X j the system A X j = B j m o d 2 6 has a unique solution, where ( 1 ≤ j ≤ 6 ) .
Using six blocks for V V I X H U I E Y C R I we obtain:
2 1 2 1
8 2 3
7 2 0
8 4
2 4 2
1 7 8
A ∗ X j = B j m o d 2 6 ⟹ X j = A − 1 ∗ B j m o d 2 6
Using A − 1 :
C = A ∣ I = ⎣ ⎡ 3 3 1 2 1 0 0 1 ⎦ ⎤ m o d 2 6
Using the row operations: 9 ∗ R o w 1 and 2 3 ∗ R o w 1 + R o w 2 ⟹
C = ⎣ ⎡ 1 0 9 1 9 2 5 0 1 ⎦ ⎤ m o d 2 6
Using the row operation: 1 7 ∗ R o w 2 + R o w 1 ⟹
C = ⎣ ⎡ 1 0 0 1 1 8 2 5 1 7 1 ⎦ ⎤ m o d 2 6
⟹
A − 1 = ⎣ ⎡ 1 8 2 5 1 7 1 ⎦ ⎤ m o d 2 6
Note: A ∗ A − 1 = I
Deciphering the first block ⎣ ⎡ 2 1 2 1 ⎦ ⎤ :
X 1 = A − 1 ∗ B 1 m o d 2 6 = ⎣ ⎡ 1 8 2 5 1 7 1 ⎦ ⎤ ∗ ⎣ ⎡ 2 1 2 1 ⎦ ⎤ m o d 2 6 = ⎣ ⎡ 7 0 ⎦ ⎤ m o d 2 6 :
Deciphering the second block ⎣ ⎡ 8 2 3 ⎦ ⎤ :
X 2 = A − 1 ∗ B 2 m o d 2 6 = ⎣ ⎡ 1 8 2 5 1 7 1 ⎦ ⎤ ∗ ⎣ ⎡ 8 2 3 ⎦ ⎤ m o d 2 6 = ⎣ ⎡ 1 5 1 5 ⎦ ⎤ m o d 2 6
Repeat the same procedure for the remaining four blocks.
Our deciphered blocks are:
7 0
1 5 1 5
2 4 1 3
4 2 2
2 4 4
0 1 7
Our plain text message is:
H A P P Y N E W Y E A R
As a string of integers we have: 7 0 1 5 1 5 2 4 1 3 4 2 2 2 4 4 0 1 7 .