| Line 3: | Line 3: | ||
1. Assuming the secret matrix is invertible, Bob can find the inverse of the secret matrix and apply it to the secret message 3 elements at a time just as the original matrix is applied to the original string. | 1. Assuming the secret matrix is invertible, Bob can find the inverse of the secret matrix and apply it to the secret message 3 elements at a time just as the original matrix is applied to the original string. | ||
| − | 2. Yes, | + | 2. Yes if 0=_,A=1,B=2,...,Z=26 her messages are A_D_A_A_A => B____A___C |
Revision as of 15:16, 19 September 2008
Homework 3_ECE301Fall2008mboutin - A - B - C
1. Assuming the secret matrix is invertible, Bob can find the inverse of the secret matrix and apply it to the secret message 3 elements at a time just as the original matrix is applied to the original string.
2. Yes if 0=_,A=1,B=2,...,Z=26 her messages are A_D_A_A_A => B____A___C
