Upload to Canvas a PDF scan of your work for problems 1–3.
In \(M_2(\mathbb{Z}_{26})\), compute the inverse of the matrix \(\begin{bmatrix} 3 & 2 \\ 2 & 5\end{bmatrix}\) using Gaussian elimination. Show all the steps, one row operation at a time. The first step is done for you. \[ \begin{aligned} & \left[\begin{array}{cc|cc} 3 & 2 & 1 & 0 \\ 2 & 5 & 0 & 1 \end{array}\right] \\ \sim & \left[\begin{array}{cc|cc} 1 & 18 & 9 & 0 \\ 2 & 5 & 0 & 1 \end{array}\right] & R_1 \leftarrow 9R_1 \\ \sim & \,\,\cdots \end{aligned} \]
Let \(\mathbf{w} = (1,0,1)\), \(\mathbf{x} = (0,1,0)\), \(\mathbf{y} = (0,1,1)\), and \(\mathbf{z} = (1,1,0)\) be vectors in \(\mathbb{Z}_2^3\). Finding a dependence relation on these vectors amounts to finding scalars \(a,b,c,d \in \mathbb{Z}_2\) such that \(a\mathbf{w} + b\mathbf{x} + c\mathbf{y} + d\mathbf{z} = \mathbf{0}\).
Add the file hillcipher.R to your R package and rebuild. Show, by example, that changing one letter of plaintext can change more than one letter of ciphertext. How much of the ciphertext changes? Does it matter which letter of plaintext changes?
key <- matrix(c(1,4,11, 2,5,9, 3,6,8), nrow = 3, ncol = 3);
hillCipher("whathappensifyouchangeoneletteroftheplaintext", key)