Skip to main content
Unit of study_

Number Theory and Cryptography - MATH2088

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)


MATH2068 or MATH2988


Faculty: Science

Semester 2

05 Aug 2019

Department/School: Mathematics and Statistics Academic Operations
Study Mode: Normal (lecture/lab/tutorial) day
Census Date: 31 Aug 2019
Unit of study level: Intermediate
Credit points: 6.0
EFTSL: 0.125
Available for study abroad and exchange: Yes
Faculty/department permission required? No
More details
Unit of Study coordinator: Dr Daniel Hauer
HECS Band: 2
Courses that offer this unit

Non-award/non-degree study If you wish to undertake one or more units of study (subjects) for your own interest but not towards a degree, you may enrol in single units as a non-award student. Cross-institutional study If you are from another Australian tertiary institution you may be permitted to undertake cross-institutional study in one or more units of study at the University of Sydney.

To help you understand common terms that we use at the University, we offer an online glossary.