(New page: == Part C: Application of Linearity == 1. Bob can decrypt the message by multiplying it (in groups of 3 numbers) by the inverse of the 3-by-3 secret matrix.)
 
(Part C: Application of Linearity)
Line 2: Line 2:
 
== Part C: Application of Linearity ==
 
== Part C: Application of Linearity ==
 
1.  Bob can decrypt the message by multiplying it (in groups of 3 numbers) by the inverse of the 3-by-3 secret matrix.
 
1.  Bob can decrypt the message by multiplying it (in groups of 3 numbers) by the inverse of the 3-by-3 secret matrix.
 +
<br>
 +
<br>
 +
2.  No.  <math>[Secret Message]*[Secret Matrix]=[Encoded Message]\!</math>.  Thus the only way to solve for the secret message if the encoded message were known would be to multiply both sides by the inverse of the 3-by-3 secret matrix.

Revision as of 12:31, 18 September 2008

Part C: Application of Linearity

1. Bob can decrypt the message by multiplying it (in groups of 3 numbers) by the inverse of the 3-by-3 secret matrix.

2. No. $ [Secret Message]*[Secret Matrix]=[Encoded Message]\! $. Thus the only way to solve for the secret message if the encoded message were known would be to multiply both sides by the inverse of the 3-by-3 secret matrix.

Alumni Liaison

Ph.D. 2007, working on developing cool imaging technologies for digital cameras, camera phones, and video surveillance cameras.

Buyue Zhang