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%)
(MATH1014 or MATH1002 or MATH1902) and (MATH1001 or MATH1901 or MATH1906 or MATH1003 or MATH1903 or MATH1907 or MATH1011 or MATH1021 or MATH1921 or MATH1931 or MATH1013 or MATH1023 or MATH1923 or MATH1933 or MATH1008 or MATH1904 or MATH1064)Prohibitions
MATH2068 or MATH2988