In this lecture we use modular arithmetic to encipher text. We focus on sending the text one letter at a time using an affine encryption function. We discuss how to decrypt. We briefly consider encrypting two letters at a time.
 We also learn how to solve simultaneous congruences.