Skip to main content
Unit of study_

Number Theory and Cryptography - MATH2068

Year - 2018

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.

Classes
Three 1 hour lectures, one 1 hour tutorial and one 1 hour computer laboratory per week.

Assessment
2 hour exam, assignments, quizzes (100%)

Assumed knowledge
MATH1014 or MATH1002 or MATH1902

Pre-requisites

6 credit points of Junior Mathematics units

Prohibitions

MATH2988 or MATH3009 or MATH3024

Details

Faculty: Science

Semester 2

30 Jul 2018

Department/School: Mathematics and Statistics Academic Operations
Study Mode: Normal (lecture/lab/tutorial) day
Census Date: 31 Aug 2018
Unit of study level: Intermediate
Credit points: 6.0
EFTSL: 0.125
Available for study abroad and exchange: Yes
Faculty/department permission required? No
Location
Camperdown
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.