COMPLEXITY, CRYPTOGRAPHY AND COMPRESSION

MAT5CCC

2018

Credit points: 15

Subject outline

In this subject students will develop the mathematical basis for cryptography and compression. A variety of specific methods of encryption and data compression will be learnt, including examples of historical relevance and examples of current usage in information transfer and storage. A number of underlying mathematical concepts will be encountered, including an introduction to computational complexity and randomness.

SchoolSchool Engineering&Mathematical Sciences

Credit points15

Subject Co-ordinatorMarcel Jackson

Available to Study Abroad StudentsNo

Subject year levelYear Level 5 - Masters

Exchange StudentsYes

Subject particulars

Subject rules

Prerequisites Must be admitted in one of the following courses: SHS (in mathematics or statistics) or SMDS

Co-requisitesN/A

Incompatible subjectsN/A

Equivalent subjectsN/A

Special conditionsN/A

Readings

Resource TypeTitleResource RequirementAuthor and YearPublisher
ReadingsCryptography and CompressionRecommendedDepartment of Mathematics and StatisticsDepartment of Mathematics and Statistics

Graduate capabilities & intended learning outcomes

01. Classify computational problems in terms of basic complexity classes, and analyze comparative complexity by way of basic reductions.

Activities:
Active participation in the online modules and lecture/problem class.

02. Apply a range of cryptographic techniques to encode and decode information.

Activities:
Active participation in the online modules and lecture/problem class.

03. Apply compression algorithms and processes to digital information

Activities:
Active participation in the online modules and lecture/problem class.

04. Select and implement compression and/or encryption techniques appropriate for context.

Activities:
Active participation in the online modules and lecture/problem class.

05. Write clear, well-structured written arguments to prove the validity of problem reductions.

Activities:
Active participation in the online modules and lecture/problem class.

06. Implement low-level encryption and compression techniques within computer algebra package.

Activities:
Lecture/problem class.

Subject options

Select to view your study options…

Start date between: and    Key dates

Melbourne, 2018, Semester 2, Blended

Overview

Online enrolmentYes

Maximum enrolment sizeN/A

Enrolment information

Subject Instance Co-ordinatorMarcel Jackson

Class requirements

Unscheduled Online Class Week: 31 - 43
Twelve 2.0 hours unscheduled online class per study period on any day including weekend during the day from week 31 to week 43 and delivered via online.

Lecture/Workshop Week: 31 - 43
Twelve 1.0 hours lecture/workshop per study period on weekdays during the day from week 31 to week 43 and delivered via face-to-face.

Assessments

Assessment elementComments% ILO*
4 written assignments (approx. 750 words each)50 01, 02, 03, 04, 05
1 written investigation (approx. 1000 words)20 01, 02, 03, 04, 05, 06
1 take home exam (approx. 2000 words)30 01, 02, 03, 04, 05