(Part 2)
 
(4 intermediate revisions by the same user not shown)
Line 11: Line 11:
 
The asnwer is "yes." She can find the inverse of the secret matrix from the intercepted message. Or she can apply the intercepted information linearly to a wanted set of data. <br>
 
The asnwer is "yes." She can find the inverse of the secret matrix from the intercepted message. Or she can apply the intercepted information linearly to a wanted set of data. <br>
 
The coded and decrypted message can be arranged in a 3-by-3 matrix form. <br><br>
 
The coded and decrypted message can be arranged in a 3-by-3 matrix form. <br><br>
 +
----------------------------------------------------------------------------------------------------------------------------
 
:<math> Coded = \begin{bmatrix}
 
:<math> Coded = \begin{bmatrix}
 
1 & 0 & 4 \\ 0 & 1 & 0 \\ 1 & 0 & 1 \\  
 
1 & 0 & 4 \\ 0 & 1 & 0 \\ 1 & 0 & 1 \\  
Line 38: Line 39:
  
 
<br>
 
<br>
Applying the secret matrix A to the message (2, 23, 3), we get,<br><br>
 
 
<math> Message\ = \begin{bmatrix} 2 & 23 & 3 \\\end{bmatrix} * \begin{bmatrix} 1/2 & 0 & 4/3 \\ 0 & 1 & 0 \\ 1/2 & 0 & 1/3 \\\end{bmatrix} = </math>
 
  
 
==Part3==
 
==Part3==
 
Method 1.<br>
 
Method 1.<br>
 
Previously, we observe that (1,0,4,0,1,0,1,0,1) yields (2,0,0,0,1,0,0,0,3).<br><br>
 
Previously, we observe that (1,0,4,0,1,0,1,0,1) yields (2,0,0,0,1,0,0,0,3).<br><br>
(1, 0, 4)  -----> Matrix Encryption -----> (2, 0, 0) ......................... (1)<br>
+
(1, 0, 4)  -----> Matrix Encryption -----> (2, 0, 0)   ......................... (1)<br>
(1, 0, 1)  -----> Matrix Encryption -----> (0, 0, 3)  ......................... (2)<br><br>
+
(0, 1, 0)  -----> Matrix Encryption -----> (0, 1, 0)  ......................... (2)<br>
Because the system is linear, (1) - (2) results in the subtraction of the result of (2) from that of (1). <br><br>
+
(1, 0, 1)  -----> Matrix Encryption -----> (0, 0, 3)   ......................... (3)<br><br>
(0, 0, 3)  -----> Matrix Encryption -----> (2, 0, -3) ......................... (3)<br>
+
 
 +
(1) + (2) X 23 + (3) would yield the desired output(provided that the system is linear) <br>
 
<br>
 
<br>
(0, 1, 0) -----> Matrix Encryption -----> (0, 1, 0)  ......................... (4)<br>
+
(1) + (2) X 23 + (3) = (1, 0, 4) + (0, 23, 0) + (1, 0, 1) = (2, 23, 5)
Or<br>
+
(0, 23, 0) -----> Matrix Encryption -----> (0, 23, 0)  ......................... (4)'<br>
+
<br>
+
Multiply (2) by 4 yields<br>
+
(4, 0, 4)  -----> Matrix Encryption -----> (0, 0, 12)  ......................... (5)<br>
+
<br>
+
Subtract (1) from (5)<br>
+
(3, 0, 0)  -----> Matrix Encryption -----> (-2, 0, 12) ......................... (6)<br>
+
Now multiply (6) by 2/3 to get (2, 0, 0).<br>
+
(2, 0, 0)  -----> Matrix Encryption -----> (-4/3, 0, 8)......................... (7)<br>
+
<br>
+
Now add (7), (4)', and (3) together to get (2, 23, 3).<br><br>
+
(2, 0, 0) + (0, 23, 0) + (0, 0, 3) ---------> Matrix Encryption ---------> (-4/3, 0, 8) + (0, 23, 0) + (2, 0, -3)
+
<br>
+
(2, 23, 3) -----> Matrix Encryption -----> (2/3, 23, 5)
+
<br><br>
+
(2, 23, 3) -----> Matrix Encryption -----> (9, 23, 9).<br><br>
+
  
  
 +
<br><br>
 +
Method 2.<br>
 +
Using the inverse matrix.<br>
  
 +
Applying the secret matrix A to the message (2, 23, 3), we get,<br><br>
  
 
+
<math> Message\ = \begin{bmatrix} 2 & 23 & 3 \\\end{bmatrix} * \begin{bmatrix} 1/2 & 0 & 4/3 \\ 0 & 1 & 0 \\ 1/2 & 0 & 1/3 \\\end{bmatrix} = </math>
Method 2.<br>
+
Use the inverse of the secret matrix.
+

Latest revision as of 18:00, 19 September 2008

This was an interesting question Professor Boutin


Part 1

How can Bob decrypt the message?

Bob can decrypt the message by multiplying the inverse of the 3-by-3 secret matrix with the coded message.

Part 2

Can Eve decrypt the message without finding the inverse of the secret matrix?
The asnwer is "yes." She can find the inverse of the secret matrix from the intercepted message. Or she can apply the intercepted information linearly to a wanted set of data.
The coded and decrypted message can be arranged in a 3-by-3 matrix form.


$ Coded = \begin{bmatrix} 1 & 0 & 4 \\ 0 & 1 & 0 \\ 1 & 0 & 1 \\ \end{bmatrix} \ $


$ Decrypted = \begin{bmatrix} 2 & 0 & 0 \\ 0 & 1 & 0 \\ 0 & 0 & 3 \\ \end{bmatrix} \ $


Thus

$ Coded * A\ = Decrypted $

Or (A is the Secret Matrix)

$ \begin{bmatrix} 1 & 0 & 4 \\ 0 & 1 & 0 \\ 1 & 0 & 1 \\ \end{bmatrix}\ * A = \begin{bmatrix} 2 & 0 & 0 \\ 0 & 1 & 0 \\ 0 & 0 & 3 \\ \end{bmatrix} $


$ A = \begin{bmatrix} 1 & 0 & 4 \\ 0 & 1 & 0 \\ 1 & 0 & 1 \\ \end{bmatrix} * \begin{bmatrix} 2 & 0 & 0 \\ 0 & 1 & 0 \\ 0 & 0 & 3 \\\end{bmatrix}^{-1} = \begin{bmatrix} 1/2 & 0 & 4/3 \\ 0 & 1 & 0 \\ 1/2 & 0 & 1/3 \\\end{bmatrix} $


Part3

Method 1.
Previously, we observe that (1,0,4,0,1,0,1,0,1) yields (2,0,0,0,1,0,0,0,3).

(1, 0, 4) -----> Matrix Encryption -----> (2, 0, 0) ......................... (1)
(0, 1, 0) -----> Matrix Encryption -----> (0, 1, 0) ......................... (2)
(1, 0, 1) -----> Matrix Encryption -----> (0, 0, 3) ......................... (3)

(1) + (2) X 23 + (3) would yield the desired output(provided that the system is linear)

(1) + (2) X 23 + (3) = (1, 0, 4) + (0, 23, 0) + (1, 0, 1) = (2, 23, 5)




Method 2.
Using the inverse matrix.

Applying the secret matrix A to the message (2, 23, 3), we get,

$ Message\ = \begin{bmatrix} 2 & 23 & 3 \\\end{bmatrix} * \begin{bmatrix} 1/2 & 0 & 4/3 \\ 0 & 1 & 0 \\ 1/2 & 0 & 1/3 \\\end{bmatrix} = $

Alumni Liaison

Correspondence Chess Grandmaster and Purdue Alumni

Prof. Dan Fleetwood