Skip to main content
Unit of study_

MATH2988: Number Theory and Cryptography Adv

This unit of study is an advanced version of MATH2088, sharing the same lectures but with more advanced topics introduced in the tutorials and computer laboratory sessions.

Details

Academic unit Mathematics and Statistics Academic Operations
Unit code MATH2988
Unit name Number Theory and Cryptography Adv
Session, year
? 
Semester 2, 2022
Attendance mode Normal day
Location Remote
Credit points 6

Enrolment rules

Prohibitions
? 
MATH2068 or MATH2088
Prerequisites
? 
MATH1902 or MATH1904 or (a mark of 65 or above in MATH1002 or MATH1004 or MATH1064)
Corequisites
? 
None
Available to study abroad and exchange students

Yes

Teaching staff and contact details

Coordinator Dzmitry Badziahin, dzmitry.badziahin@sydney.edu.au
Type Description Weight Due Length
Final exam (Take-home short release) Type D final exam Exam
Examination
60% Formal exam period 2 hours
Outcomes assessed: LO1 LO6 LO5 LO4 LO3 LO2
Assignment Assignment 1
Assignment
10% Week 06
Due date: 08 Sep 2022 at 23:59

Closing date: 15 Sep 2022
See Canvas
Outcomes assessed: LO1 LO2 LO3 LO4 LO5 LO6
Tutorial quiz Quiz 1
Quiz
10% Week 08 45 minutes
Outcomes assessed: LO1 LO2 LO3 LO4 LO5 LO6
Assignment Assignment 2
Assignment
10% Week 11
Due date: 20 Oct 2022 at 23:59

Closing date: 27 Oct 2022
See Canvas
Outcomes assessed: LO2 LO3 LO4 LO6
Tutorial quiz Quiz 2
Quiz
10% Week 12 45 minutes
Outcomes assessed: LO1 LO2 LO3 LO4 LO6
Type D final exam = Type D final exam ?
  • Quizzes: The quizzes test students’ understanding of the basic concepts and computational methods from the lectures and tutorials in weeks 1–6 for quiz 1, and in weeks 7–11 for quiz 2. University-approved non-programmable calculators may be used.
  • Assignments: The assignments will be comprised of a theoretical element, testing students’ understanding of the number theory developed in lectures and tutorials (including ability to write correct proofs), and a computorial element, testing students’ understanding of the cryptographic concepts and methods developed in lectures and computer labs.
  • Final exam: The exam will test the learning outcomes attained in lectures, tutorials and computer labs. University-approved non-programmable calculators may be used.

Detailed information for each assessment can be found on Canvas.

Assessment criteria

The University awards common result grades, set out in the Coursework Policy 2014 (Schedule 1).

As a general guide, a high distinction indicates work of an exceptional standard, a distinction a very high standard, a credit a good standard, and a pass an acceptable standard.

Result name

Mark range

Description

High distinction

85 - 100

Represents complete or close to complete mastery of the material.

Distinction

75 - 84

Represents excellence, but substantially less than complete mastery.

Credit

65 - 74

Represents a creditable performance that goes beyond routine knowledge and understanding, but less than excellence.

Pass

50 - 64

Represents at least routine knowledge and understanding over a spectrum of topics and important ideas and concepts in the course.

Fail

0 - 49

When you don’t meet the learning outcomes of the unit to a satisfactory standard.

For more information see sydney.edu.au/students/guide-to-grades.

Late submission

In accordance with University policy, these penalties apply when written work is submitted after 11:59pm on the due date:

  • Deduction of 5% of the maximum mark for each calendar day after the due date.
  • After ten calendar days late, a mark of zero will be awarded.

Special consideration

If you experience short-term circumstances beyond your control, such as illness, injury or misadventure or if you have essential commitments which impact your preparation or performance in an assessment, you may be eligible for special consideration or special arrangements.

Academic integrity

The Current Student website provides information on academic honesty, academic dishonesty, and the resources available to all students.

The University expects students and staff to act ethically and honestly and will treat all allegations of academic dishonesty or plagiarism seriously.

We use similarity detection software to detect potential instances of plagiarism or other forms of academic dishonesty. If such matches indicate evidence of plagiarism or other forms of dishonesty, your teacher is required to report your work for further investigation.

WK Topic Learning activity Learning outcomes
Week 01 1. Introduction to number theory and cryptography; 2. Mathematical induction Lecture (1 hr) LO1
1. Divisibility; 2. Greatest common divisors; 3. Euclidean algorithm Lecture (1 hr) LO1 LO6
1. Extended Euclidean algorithm; 2. Prime and composite numbers Lecture (1 hr) LO1 LO2 LO3 LO6
Week 02 1. Fundamental theorem of arithmetic; 2. Factorisation; 3. Fermat method Lecture (1 hr) LO2 LO3 LO6
1. Congruencies; 2. Complete and reduced systems of residues Lecture (1 hr) LO1 LO6
1. Inverses; 2. Powers and order in modular arithmetic Lecture (1 hr) LO1 LO2 LO3 LO6
Week 03 1. Basic concepts of cryptography; 2. Classical cryptosystems Lecture (1 hr) LO4
Statistical attacks on classical cryptosystems Lecture (1 hr) LO4 LO5
1. Euler–Fermat Theorem; 2. RSA theorem Lecture (1 hr) LO2 LO6
Week 04 Relating congruences with different moduli Lecture (1 hr) LO6
1. Chinese Remainder Theorem; 2. Computing big powers in modular arithmetics Lecture (1 hr) LO2 LO3
Computation of k’th root modulo a number Lecture (1 hr) LO2 LO3 LO6
Week 05 1. Multiplicative functions; 2. Euler’s phi function; 3. Mobius and Liouville functions Lecture (1 hr) LO1 LO6
Sum and number of divisors Lecture (1 hr) LO6
1. Classification of even perfect numbers; 2. More on Euler phi-function Lecture (1 hr) LO6
Week 06 Relating different multiplicative functions Lecture (1 hr) LO2 LO6
Mobius inversion formula Lecture (1 hr) LO2 LO6
The RSA public key cryptosystem Lecture (1 hr) LO4
Week 07 1. Computational complexity; 2. Elementary bit operations Lecture (1 hr) LO1
1. Complexity of multiplication; 2. Karatsuba method Lecture (1 hr) LO1 LO2 LO3
Big-O notation computational complexity of Euclidean algorithm Lecture (1 hr) LO1 LO6
Week 08 1. Complexity of power algorithm; 2. Complexity of primality checks Lecture (1 hr) LO1 LO2 LO3
Pollard’s rho factorisation algorithm Lecture (1 hr) LO2 LO3
Polynomial congruences Lecture (1 hr) LO1 LO6
Week 09 Primitive roots and discrete logarithms Lecture (1 hr) LO1 LO6
1. Diffie–Hellman key exchange protocol; 2. Elgamal cryptosystem Lecture (1 hr) LO4
Week 10 1. Safe primes; 2. Finding primitive roots Lecture (1 hr) LO2 LO3 LO6
Applications of primitive roots Lecture (1 hr) LO2 LO6
Modular Lagrange interpolation formula Lecture (1 hr) LO2 LO3 LO6
Week 11 1. Secret sharing; 2. Baby-step/giant-step algorithm for discrete logarithms Lecture (1 hr) LO2 LO3 LO4
Pohlig–Hellman algorithm for discrete logarithms Lecture (1 hr) LO2 LO3
Quadratic residues Lecture (1 hr) LO1 LO6
Week 12 Square roots modulo a prime Lecture (1 hr) LO1 LO2 LO3 LO6
1. Square root problem modulo a composite number; 2. Rabin’s public key cryptosystem Lecture (1 hr) LO2 LO4

Study commitment

Typically, there is a minimum expectation of 1.5-2 hours of student effort per week per credit point for units of study offered over a full semester. For a 6 credit point unit, this equates to roughly 120-150 hours of student effort in total.

Required readings

The textbook for the course is

  • R. Howlett, Number Theory and Cryptography, School of Mathematics and Statistics, University of Sydney, 2019.

Although lecture notes will be posted, you will probably need a copy of the textbook, which is available from Kopystop. The changes from previous years’ editions are minimal, so second-hand copies will be fine.

Learning outcomes are what students know, understand and are able to do on completion of a unit of study. They are aligned with the University’s graduate qualities and are assessed as part of the curriculum.

At the completion of this unit, you should be able to:

  • LO1. understand and use the basic terminology of number theory and cryptography
  • LO2. carry out simple number-theoretic computations either with a calculator or using MAGMA
  • LO3. apply standard number-theoretic algorithms
  • LO4. understand and use some classical and number-theoretic cryptosystems
  • LO5. apply standard methods to attack some classical cryptosystems
  • LO6. understand the theory underlying number-theoretic algorithms and cryptosystems, including the general properties of primes, prime factorisation, modular arithmetic, divisors and multiplicative functions, powers and discrete logarithms.

Graduate qualities

The graduate qualities are the qualities and skills that all University of Sydney graduates must demonstrate on successful completion of an award course. As a future Sydney graduate, the set of qualities have been designed to equip you for the contemporary world.

GQ1 Depth of disciplinary expertise

Deep disciplinary expertise is the ability to integrate and rigorously apply knowledge, understanding and skills of a recognised discipline defined by scholarly activity, as well as familiarity with evolving practice of the discipline.

GQ2 Critical thinking and problem solving

Critical thinking and problem solving are the questioning of ideas, evidence and assumptions in order to propose and evaluate hypotheses or alternative arguments before formulating a conclusion or a solution to an identified problem.

GQ3 Oral and written communication

Effective communication, in both oral and written form, is the clear exchange of meaning in a manner that is appropriate to audience and context.

GQ4 Information and digital literacy

Information and digital literacy is the ability to locate, interpret, evaluate, manage, adapt, integrate, create and convey information using appropriate resources, tools and strategies.

GQ5 Inventiveness

Generating novel ideas and solutions.

GQ6 Cultural competence

Cultural Competence is the ability to actively, ethically, respectfully, and successfully engage across and between cultures. In the Australian context, this includes and celebrates Aboriginal and Torres Strait Islander cultures, knowledge systems, and a mature understanding of contemporary issues.

GQ7 Interdisciplinary effectiveness

Interdisciplinary effectiveness is the integration and synthesis of multiple viewpoints and practices, working effectively across disciplinary boundaries.

GQ8 Integrated professional, ethical, and personal identity

An integrated professional, ethical and personal identity is understanding the interaction between one’s personal and professional selves in an ethical context.

GQ9 Influence

Engaging others in a process, idea or vision.

Outcome map

Learning outcomes Graduate qualities
GQ1 GQ2 GQ3 GQ4 GQ5 GQ6 GQ7 GQ8 GQ9
No changes have been made since this unit was last offered

Work, health and safety

We are governed by the Work Health and Safety Act 2011, Work Health and Safety Regulation 2011 and Codes of Practice. Penalties for non-compliance have increased. Everyone has a responsibility for health and safety at work. The University’s Work Health and Safety policy explains the responsibilities and expectations of workers and others, and the procedures for managing WHS risks associated with University activities.

General laboratory safety rules

  • No eating or drinking is allowed in any laboratory under any circumstances 

  • A laboratory coat and closed-toe shoes are mandatory 

  • Follow safety instructions in your manual and posted in laboratories 

  • In case of fire, follow instructions posted outside the laboratory door 

  • First aid kits, eye wash and fire extinguishers are located in or immediately outside each laboratory 

  • As a precautionary measure, it is recommended that you have a current tetanus immunisation. This can be obtained from University Health Service: unihealth.usyd.edu.au/

Disclaimer

The University reserves the right to amend units of study or no longer offer certain units, including where there are low enrolment numbers.

To help you understand common terms that we use at the University, we offer an online glossary.