Almost all finite groups encountered by undergraduates can be represented as multiplicative groups of concise block-diagonal binary matrices. Such representations provide simple examples for beginning a group theory course. More importantly, these representations provide concrete models for "abstract" concepts. We describe Maple lab…

We present an algorithm for a matrix-based Enigma-type encoder based on a variation of the Hill Cipher as an application of 2 × 2 matrices. In particular, students will use vector addition and 2 × 2 matrix multiplication by column vectors to simulate a matrix version of the German Enigma Encoding Machine as a basic example of cryptography. The…