Number Theory and Cryptology (MAT4137.01)

Carly Briggs

Communicating sensitive or secretive information has been a human endeavor for centuries and so is the quest to decode such information. In this course, we will study cryptology which encompasses both cryptography, the process of encoding information and cryptanalysis, the process of independently decoding information, without the help of the people or system that encoded it. This course will cover ancient ciphers, such as the Caesar shift cipher, mechanical encryption methods, such as the Enigma machine, and modern public-key encryption methods, such as RSA encryption. Each cryptosystem will be introduced using the historical context under which the system was first developed. Almost all cryptology methods rely on the mathematics of number theory, the study of the positive whole numbers. This course will focus on the specific number theory concepts required to understand each cryptosystem including the Euclidean algorithm and modular arithmetic, matrix multiplication, permutations and the symmetric group, non-decimal arithmetic, primes and factorization.

Prerequisites: Logic, Proofs, Set Theory and Algebra, or Discrete Mathematics, or permission of the instructor. Interested students should send an email to Andrew McIntyre when 4000 registration opens. Registration is first-come, first-served.
Credits: 4
M 4:10pm - 6:00pm; Th 4:10pm - 6:00pm
Maximum Enrollment: 20
This course is categorized as All courses, Four Credit, 4000, Computer Science, Mathematics, Monday and/or Thursday Afternoons, Carly Briggs.