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.

SchoolEngineering and Mathematical Sciences

Credit points15

Subject Co-ordinatorMarcel Jackson

Available to Study Abroad/Exchange StudentsYes

Subject year levelYear Level 5 - Masters

Available as ElectiveNo

Learning ActivitiesN/A

Capstone subjectNo

Subject particulars

Subject rules

Prerequisites Students must be admitted in one of the following courses: SHS (in mathematics or statistics or computer science), SMDS, SHCS, SMCYC, SMAI, SMELE, SMICT, SMIT, SMITCN, SMTNE, SMENM, SMENC.


Incompatible subjectsN/A

Equivalent subjectsN/A

Quota Management StrategyN/A

Quota-conditions or rulesN/A

Special conditionsN/A

Minimum credit point requirementN/A

Assumed knowledgeN/A

Learning resources

Cryptography and Compression

Resource TypeBook

Resource RequirementRecommended

AuthorDepartment of Mathematics and Statistics



PublisherDepartment of Mathematics and Statistics


Chapter/article titleN/A



Other descriptionN/A

Source locationN/A

Career Ready


Work-based learningNo

Self sourced or Uni sourcedN/A

Entire subject or partial subjectN/A

Total hours/days requiredN/A

Location of WBL activity (region)N/A

WBL addtional requirementsN/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.

Subject options

Select to view your study options…

Start date between: and    Key dates

Melbourne (Bundoora), 2021, Semester 2, Blended


Online enrolmentYes

Maximum enrolment sizeN/A

Subject Instance Co-ordinatorMarcel Jackson

Class requirements

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

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


Assessment elementCommentsCategoryContributionHurdle% ILO*

4 written assignments (approx. 750 words each)

N/AAssignmentIndividualNo50 SILO1, SILO2, SILO3, SILO4, SILO5

1 written investigation (approx. 1000 words)

N/AOtherIndividualNo20 SILO1, SILO2, SILO3, SILO4, SILO5, SILO6

1 take home exam (approx. 2000 words)

N/AOther written examIndividualNo30 SILO1, SILO2, SILO3, SILO4, SILO5