| Line 1: | Line 1: | ||
| − | [[Homework 3_ECE301Fall2008mboutin]] - | + | [[Homework 3_ECE301Fall2008mboutin]] - [[HW3.A Allen Humphreys_ECE301Fall2008mboutin|'''A''']] - [[HW3.B Allen Humphreys_ECE301Fall2008mboutin|'''B''']] - [[HW3.C Allen Humphreys_ECE301Fall2008mboutin|'''C''']] |
| − | [[HW3.A Allen Humphreys_ECE301Fall2008mboutin|'''A''']] - | + | |
| − | [[HW3.B Allen Humphreys_ECE301Fall2008mboutin|'''B''']] - | + | 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. |
| − | [[HW3.C Allen Humphreys_ECE301Fall2008mboutin|'''C''']] | + | |
| + | 2. Yes, though I'm not sure how right now. | ||
Revision as of 14:49, 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, though I'm not sure how right now.
