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.
Unit details and rules
Academic unit | Mathematics and Statistics Academic Operations |
---|---|
Credit points | 6 |
Prerequisites
?
|
MATH1002 or MATH1902 or MATH1004 or MATH1904 or MATH1064 or (a mark of 65 or above in MATH1014) |
Corequisites
?
|
None |
Prohibitions
?
|
MATH2068 or MATH2988 |
Assumed knowledge
?
|
None |
Available to study abroad and exchange students | Yes |
Teaching staff
Coordinator | Dzmitry Badziahin, dzmitry.badziahin@sydney.edu.au |
---|---|
Tutor(s) | Albie Ewins, aewi0252@uni.sydney.edu.au |
Van Nguyen, van.nguyen@sydney.edu.au | |
Mengfan Lyu, mengfan.lyu@sydney.edu.au |