7.7.1: Application of Matrices in Cryptography (Exercises)
( \newcommand{\kernel}{\mathrm{null}\,}\)
selected template will load here
This action is not available.
( \newcommand{\kernel}{\mathrm{null}\,}\)
In problems 1 - 8, the letters A to Z correspond to the numbers 1 to 26, as shown below, and a space is represented by the number 27.
ABCDEFGHIJKLM12345678910111213NOPQRSTUVWXYZ14151617181920212223242526
In problems 1 - 2, use the matrix A, given below, to encode the given messages.
A=[3211]
In problems 3 - 4, decode the messages that were encoded using matrix A.
Make sure to consider the spaces between words, but ignore all punctuation. Add a final space if necessary.
|
|
64 23 102 41 82 32 97 35 71 28 69 32 |
105 40 117 48 39 19 69 32 72 27 37 15 114 47 |
SECTION 2.5 PROBLEM SET: APPLICATION OF MATRICES IN CRYPTOGRAPHY
In problems 5 - 6, use the matrix B, given below, to encode the given messages.
B=[10021210−1]
In problems 7 - 8, decode the messages that were encoded using matrix B.
Make sure to consider the spaces between words, but ignore all punctuation. Add a final space if necessary.
LUCK IS ON YOUR SIDE. |
MAY THE FORCE BE WITH YOU. |
8 23 7 4 47 - 2 15 102 -12 20 58 15 27 80 18 12 74 -7 |
12 69 - 3 11 53 9 5 46 -10 18 95 - 9 25 107 4 27 76 22 1 72 -26 |