COMPX50221A (HAM)
Cryptography
15 Points
Staff
Convenor(s)
Daniel Delbourgo
daniel.delbourgo@waikato.ac.nz

Administrator(s)
Librarian(s)
You can contact staff by:
 Calling +64 7 838 4466 select option 1, then enter the extension.

Extensions starting with 4, 5, 9 or 3 can also be direct dialled:
 For extensions starting with 4: dial +64 7 838 extension.
 For extensions starting with 5: dial +64 7 858 extension.
 For extensions starting with 9: dial +64 7 837 extension.
 For extensions starting with 3: dial +64 7 2620 + the last 3 digits of the extension e.g. 3123 = +64 7 262 0123.
Paper Description
An introduction to cryptographic methods and ideas.
The first half of this paper concerns number theory, which provides the basis of cryptography and computer security. Famous problems include for example Fermat’s Last Theorem, the Riemann Hypothesis and the Goldbach Conjecture. Topics covered in the paper include sums of squares, finding rational points on curves, arithmetic functions, and Gauss' law of quadratic reciprocity.
The Cryptography half of this paper will cover the basics of both public and private key cryptosystems. We will touch on some simple cryptosystems, key exchange, trapdoor functions, Feistel and other block cyphers, Data Encryption Standard, R.S.A., MasseyOmura, and El Gamal. We will also look at some Information Theory, the notions of entropy, key equivocation and unicity distance, as well as a proof of Shannon's noiseless coding theorem
Paper Structure
Learning Outcomes
Students who successfully complete the paper should be able to:
Assessment
There are two streams in this paper: the Mathematics Steam and the Computer Science Stream.
The Mathematics Stream do more theoretical work in the first half of the semester, but will not need to do the final group project.
The Computer Science Stream will do less from the Number Theory half but will have a final group programming project to undertake, which will be assessed at the end of the course.
Assessment Components
The internal assessment/exam ratio (as stated in the University Calendar) is 100:0. There is no final exam.
Required and Recommended Readings
Required Readings
N/A
Recommended Readings
N/A
Other Resources
N/A
Online Support
Workload
Linkages to Other Papers
Prerequisite(s)
Prerequisite papers: MATHS135 or MATHS202 or COMPX361
Restriction(s)
Restricted papers: MATHS314, COMPX364