Module $01$ Discussion: Modular Arithmetic and Substitution Ciphers

Initial Post

There are three parts to this discussion:

Go to the Zm Sign$-$Up page in this module and claim a number m by editing the page and entering your name $($first come, first serve$).$ Then complete and post the multiplication table of Zm for your chosen m$,$ stating which ring Zm you are working in$.$

Complete and post the addition and multiplication tables for Z$2.$ These tables are very small, of course, but much is based on them.

I encrypted the ciphertext $($see below$)$ by using a substitution cipher as described in Chapter $1$ of the text $($i$.$e$.,$ every occurrence of A in my plaintext, which makes semantic sense in English, was replaced by some other letter, the same for B$,$ and so on$).$ Attempt to decrypt it $($you may find the letter frequency table on page $9$ of our text useful$),$ and once you have, describe in your post the reasoning and strategies you used.

UXSXFJX RICHCWX WDX MXFXIGO YXOSGIX

GFU TXJNIX WDX QOXTTZFMT CS OZQXIWP

WC CNITXOEXT GFU CNI RCTWXIZWP UC

CIUGZF GFU XTWGQOZTD WDZT JCFTWZWNWZCF

SCI WDX NFZWXU TWGWXT CS GHXIZJG