COMPX502-19B (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)

Daniel Delbourgo

Daniel Delbourgo
4425
G.3.04
To be advised
daniel.delbourgo@waikato.ac.nz

Lecturer(s)

Daniel Delbourgo

Daniel Delbourgo
4425
G.3.04
To be advised
daniel.delbourgo@waikato.ac.nz

Administrator(s)

: rachael.foote@waikato.ac.nz

Placement Coordinator(s)

Tutor(s)

Student Representative(s)

Lab Technician(s)

Librarian(s)

: debby.dada@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.

The first half of this paper concerns number theory. The oldest subject in mathematics, number theory is now as relevant as ever because it provides the basis of cryptography and computer security. Famous problems include Fermat’s Last Theorem, the Riemann Hypothesis and the Goldbach Conjecture. Topics covered in the paper include such gems as the distribution of primes, Gauss’s theory of quadratic equations modulo p, and the mysteries of the zeta-function.

The Cryptography half of this paper will cover the basics of both public and private key cryptosystems. We will touch on Information Theory, entropy, key exchange, trapdoor functions, R.S.A., Massey-Omura, and El Gamal.

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 course 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

N/A

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. Assignment 1
15
3. Test 2
20
4. Assignment 2
15
5. Final Test
30
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 + 3 hours Homework per week.
Edit Workload Content

Linkages to Other Papers

Edit Linkages Content

COMP235 Logic and Computation or MATH258 Introduction to Discrete Mathematics

Restricted Papers: the old MATH320 Discrete Mathematics and Number Theory, or the old COMP502 Cryptography

Edit Linkages Content

Prerequisite(s)

Prerequisite papers: MATHS135 or MATHS202 or MATH258 or COMP235 or COMPX361

Corequisite(s)

Equivalent(s)

Restriction(s)

Restricted papers: MATHS314, MATH320, COMP402 and COMP502

Edit Linkages Content