TheWorksheets.com

Cryptography Worksheet - University of California, Irvine

Perhaps you thought we didn’t really use any math in the Caesar shift cipher. We can make a more “mathy” version by introducing some facts about modular arithmetic: Modular arithmetic finds the remainder of a division problem. If we write a (mod b), we are finding r = remainder of . So our solution r will always be less than b.