COMPLEXITY, CRYPTOGRAPHY AND COMPRESSION

MAT5CCC

2020

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.

School: Engineering and Mathematical Sciences (Pre 2022)

Credit points: 15

Subject Co-ordinator: Marcel Jackson

Available to Study Abroad/Exchange Students: Yes

Subject year level: Year Level 5 - Masters

Exchange Students: No

Available as Elective: No

Learning Activities: N/A

Capstone subject: No

Subject particulars

Subject rules

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

Co-requisites: N/A

Incompatible subjects: N/A

Equivalent subjects: N/A

Quota Management Strategy: N/A

Quota-conditions or rules: N/A

Special conditions: N/A

Minimum credit point requirement: N/A

Assumed knowledge: N/A

Learning resources

Cryptography and Compression

Resource Type: Book

Resource Requirement: Recommended

Author: Department of Mathematics and Statistics

Year: N/A

Edition/Volume: N/A

Publisher: Department of Mathematics and Statistics

ISBN: N/A

Chapter/article title: N/A

Chapter/issue: N/A

URL: N/A

Other description: N/A

Source location: N/A

Career Ready

Career-focused: No

Work-based learning: No

Self sourced or Uni sourced: N/A

Entire subject or partial subject: N/A

Total hours/days required: N/A

Location of WBL activity (region): N/A

WBL addtional requirements: N/A

Graduate capabilities & intended learning outcomes

Graduate Capabilities

Intended Learning Outcomes

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

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

03. Apply compression algorithms and processes to digital information

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

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

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

Melbourne (Bundoora), 2020, Semester 2, Blended

Overview

Online enrolment: Yes

Maximum enrolment size: N/A

Enrolment information: N/A

Subject Instance Co-ordinator: Marcel Jackson

Class requirements

Lecture/WorkshopWeek: 31 - 43
Twelve 1.00 hour lecture/workshop per week on weekdays during the day from week 31 to week 43 and delivered via face-to-face.

Unscheduled Online ClassWeek: 31 - 43
Twelve 2.00 hours unscheduled online class per week on any day including weekend during the day from week 31 to week 43 and delivered via online.

Assessments

Assessment element	Comments	Category	Contribution	Hurdle	%	ILO*
4 written assignments (approx. 750 words each)	N/A	N/A	N/A	No	50	SILO1, SILO2, SILO3, SILO4, SILO5
1 written investigation (approx. 1000 words)	N/A	N/A	N/A	No	20	SILO1, SILO2, SILO3, SILO4, SILO5, SILO6
1 take home exam (approx. 2000 words)	N/A	N/A	N/A	No	30	SILO1, SILO2, SILO3, SILO4, SILO5