This shows you the differences between two versions of the page.
Next revision | Previous revision | ||
problem:simple_matrix_encryption [2013/08/16 17:21] bmwoodruff created |
problem:simple_matrix_encryption [2013/08/16 17:29] (current) bmwoodruff [$\LaTeX$ version] |
||
---|---|---|---|
Line 2: | Line 2: | ||
==== Problem ==== | ==== Problem ==== | ||
Consider the matrix | Consider the matrix | ||
- | $A = | + | $A = \begin{bmatrix} 2& |
- | \begin{bmatrix} | + | Joe decides to send a message to Sam by encrypting the message with the matrix $A$. He first takes his message and converts it to numbers by replacing A with 1, B with 2, C with 3, and so on till replacing Z with 26. He uses a 0 for spaces. |
- | 2& | + | |
- | 5& | + | |
- | 0& | + | |
- | \end{bmatrix} | + | |
- | $. | + | |
- | Joe decides to send a message to Sam by encrypting the message with the matrix $A$. He first takes his message and converts it to numbers by replacing A with 1, B with 2, C with 3, and so on till replacing Z with 26. He uses a 0 for spaces. | + | |
$$ | $$ | ||
\left[ | \left[ | ||
Line 37: | Line 31: | ||
$ to Sam. Sam uses the inverse of $A$ to decode the message. | $ to Sam. Sam uses the inverse of $A$ to decode the message. | ||
- Find the inverse of $A$. | - Find the inverse of $A$. | ||
- | - Use $A^{-1}$ to decode $[[ 14, 20, 45],[ -2, -10, 10],[ 32, 79, 4],[ -5, -22, 24]]$ and show the message is ``good job ben'' | + | - Use $A^{-1}$ to decode $[[ 14, 20, 45],[ -2, -10, 10],[ 32, 79, 4],[ -5, -22, 24]]$ and show the message is "good job ben." |
- Decode the message $[[39, 89, 22],[20, 48, 4],[39, 88, 33]]$. | - Decode the message $[[39, 89, 22],[20, 48, 4],[39, 88, 33]]$. | ||
Line 49: | Line 43: | ||
==== $\LaTeX$ version ==== | ==== $\LaTeX$ version ==== | ||
<file tex problem.simple_matrix_encryption.tex> | <file tex problem.simple_matrix_encryption.tex> | ||
- | %%%%% | ||
- | % DEPENDENCIES | ||
- | % RequiredPackages: | ||
- | % RequiredMacros: | ||
- | %%%%% | ||
%Encryption using matrices (and inverses to decode things). | %Encryption using matrices (and inverses to decode things). | ||
\begin{problem} | \begin{problem} | ||
Line 110: | Line 99: | ||
* | * | ||
- | {{tag> | + | {{tag> |