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, Mobius 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%)
MATH1002 or MATH1902 or MATH1004 or MATH1904 or MATH1064 or (a mark of 65 or above in MATH1014)Prohibitions
MATH2068 or MATH2988