Cryptography is the branch of mathematics that provides the techniques for confidential exchange of information sent via possibly insecure channels. This unit introduces the tools from elementary number theory that are needed to understand the mathematics underlying the most commonly used modern public key cryptosystems. Topics include the Euclidean Algorithm, Fermat's Little Theorem, the Chinese Remainder Theorem, Möbius Inversion, the RSA Cryptosystem, the Elgamal Cryptosystem and the Diffie-Hellman Protocol. Issues of computational complexity are also discussed.
Three 1 hour lectures, one 1 hour tutorial and one 1 hour computer laboratory per week.
2 hour exam, assignments, quizzes (100%)
MATH1014 or MATH1002 or MATH1902
6 credit points of Junior Mathematics unitsProhibitions
MATH2988 or MATH3009 or MATH3024