COMPX502-21A (HAM)

Cryptography

15 Points

Edit Header Content
Division of Health Engineering Computing & Science
School of Computing and Mathematical Sciences
Department of Mathematics and Statistics

Staff

Edit Staff Content

Convenor(s)

Lecturer(s)

Administrator(s)

: maria.admiraal@waikato.ac.nz
: buddhika.subasinghe@waikato.ac.nz

Placement/WIL Coordinator(s)

Tutor(s)

Student Representative(s)

Lab Technician(s)

Librarian(s)

: alistair.lamb@waikato.ac.nz

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.
Edit Staff Content

Paper Description

Edit Paper Description Content

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., Massey-Omura, 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

Edit Paper Description Content

Paper Structure

Edit Paper Structure Content
Class attendance is expected. The course notes provided are not comprehensive, additional material will be covered in class. You are responsible for all material covered in class.
Edit Paper Structure Content

Learning Outcomes

Edit Learning Outcomes Content

Students who successfully complete the paper should be able to:

  • See under paper description.
    Linked to the following assessments:
Edit Learning Outcomes Content
Edit Learning Outcomes Content

Assessment

Edit Assessments Content

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.

Edit Additional Assessment Information Content

Assessment Components

Edit Assessments Content

The internal assessment/exam ratio (as stated in the University Calendar) is 100:0. There is no final exam. The final exam makes up 0% of the overall mark.

The internal assessment/exam ratio (as stated in the University Calendar) is 100:0 or 0:0, whichever is more favourable for the student. The final exam makes up either 0% or 0% of the overall mark.

Component DescriptionDue Date TimePercentage of overall markSubmission MethodCompulsory
1. Test 1
20
2. Test 2
20
3. Assignment 1
20
4. Assignment 2
20
5. Project
20
Assessment Total:     100    
Failing to complete a compulsory assessment component of a paper will result in an IC grade
Edit Assessments Content

Required and Recommended Readings

Edit Required Readings Content

Required Readings

Edit Required Readings Content

N/A

Edit Required Readings Content

Recommended Readings

Edit Recommended Readings Content

N/A

Edit Recommended Readings Content

Other Resources

Edit Other Resources Content

N/A

Edit Other Resources Content

Online Support

Edit Online Support Content
There is a Moodle page for this paper - please check frequently for updates.
Edit Online Support Content

Workload

Edit Workload Content
3-4 Lectures per week + 4 hours Homework per week.
Edit Workload Content

Linkages to Other Papers

Edit Linkages Content

Prerequisite(s)

Prerequisite papers: MATHS135 or MATHS202 or COMPX361

Corequisite(s)

Equivalent(s)

Restriction(s)

Restricted papers: MATHS314, COMPX364

Edit Linkages Content