Math 2200
Submission Guidelines:
2) Do NOT delete Maple commands that were needed to generate the required output since your
instructor must see these commands to be sure that you followed the directions in the project.
3) Do NOT leave the output only in a form the reader has to interpret.
4) Do NOT reuse a variable or a function name for different things in different problems; note that
Maple uses what was executed last with respect to time, not what appears on the page last.
Before you execute any Maple commands below, execute the following command. You need to do this
every time you open up this worksheet.
>
>
(1.1)
(1.1)
a) [5 points] Define the matrix E in Maple. Note: if you do this incorrectly the rest of your answers
to this problem will be wrong. Verify and explain why E is a legitimate encoding matrix.
>
(1.2)
>
Because the determinant is not zero, E is a valid encoding matrix.
(1.3)
>
(1.4)
Define the matrix M associated with the given original message (plaintext), as described in the
Tutorial; give it the name M.
>
25 (1.5)
>
>
(1.6)
(1.6)
c) [3 pts] Compute the matrix S = EM (calculated in Maple) associated with the given encoded
message (ciphertext).
>
(1.7)
d) [2 pts] Give the numeric string, in the appropriate order, of the encoded message, separated by
commas:
>
(1.8)
>
(1.9)
>
(1.10)
(1.10)
>
(1.11)
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26.
We also associate 27 with "." (period) ; 28 with "," (comma) ; and 0 with " " (blank) .
A clever cryptanalyst has determined that the four most common blocks of length four in a particular
encoded message using a particular modular Hill 4-cipher are OXSX, LUYK, WECI , and ETXB and
she guesses that these ciphertext combinations correspond to the most common groups of four letters
in English text, TION, ATIO, THAT, and THER. Using that information she concludes that the
plaintext N was enciphered to the ciphertext T using a Hill 4-cipher described by T = FN (mod 29)
F=
>
(2.1)
>
b) [4 pts] Demonstrate that F is a legitimate encoding matrix mod 29. Explain why your answer
indicates that F is a legitimate encoding matrix.
>
Because the determinant is not zero, F is invertible. Therefore F is a valid encoding matrix.
27 (2.2)
c) [5 pts] Show that, in fact, F encodes TION, ATIO, THAT, and THER as OXSX, LUYK, WECI ,
and ETXB, respectively.
>
(2.3)
>
(2.4)
The decoded message is: OXSXLUYKWECIETXB = OXSX, LUYK, WECI, ETXB. Thus, F does
encode TION, ATIO, THAT, and THER properly.
d) [7 pts] Using F as your encoding matrix, encode the message THE ECLIPSE WAS TRULY
AMAZING (padding as necessary at the end with blanks) and then write it as a series of
letters/punctuation marks/blanks, using underscure swhere blanks occur.
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26.
We also associate 27 with "." (period) ; 28 with "," (comma) ; and 0 with " " (blank) .
>
(2.5)
(2.5)
>
(2.6)
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26.
We also associate 27 with "." (period) ; 28 with "," (comma) ; and 0 with " " (blank) .
>
(2.7)
>
(2.8)