MATH3213 programs

Introduction to Number Theory and Cryptography

This course introduces elementary number theory and its role in modern cryptography. Number theory studies the additive and multiplicative structures of the integers and the solutions of equations involving them, while cryptography provides methods for secure communication. We will develop fundamental concepts of number theory and modular arithmetic, including divisibility, congruences, and the arithmetic of the integers modulo n, and explore number-theoretic structures and algorithms that are central to cryptographic applications. These ideas are used to motivate and analyze classical and public-key cryptographic schemes, illustrating how mathematical assumptions underpin security. By the end of the course, students will be able to apply number-theoretic reasoning to computational and proof-based problems and to execute and evaluate cryptographic methods in an introductory setting.

–
Average rating
Rate a teacher to start
6
ECTS
180
hours in a term
4
class hours a week
From the Spring 2026 syllabus

What you will learn

  • •Compute and apply fundamental concepts of elementary number theory and modular arithmetic, including solving linear congruences, analyzing Diophantine equations, and solving computational and proof-based problems.
  • •Analyze and evaluate the multiplicative structure of the integers and their quotient rings, as well as number-theoretic algorithms and theoretical tools.
  • •Apply number-theoretic methods to execute and evaluate classical and public-key cryptographic schemes at an introductory level, identifying the mathematical assumptions underlying their security.
  • •Compare symmetric and asymmetric cryptographic approaches by relating their security properties to underlying number-theoretic structures and computational hardness assumptions.
  • •Communicate mathematical and cryptographic reasoning clearly in written form, using appropriate notation and logical structure.

How it is graded

10%
Online Tests
Week 1-16
10%
Class Participation
Week 1-16
35%
Midterm Exam
Week 8
45%
Final Exam
Week 16

Workload

180 hours in a term, about 12 a week
In-Class Time 56 hIndependent Study 30 hAssignments 70 hExaminations 4 hGroup Discussions 20 h

Week by week

Books

Elementary Number Theory and Its Applications
Kenneth H. Rosen, 6th edition
required

Where it fits

NeedsMATH221

Requirements come from syllabi. Check with your advisor.

Rules

Attendance is compulsory. A student missing 25% (32 hours or more) of all instructed hours will be forced to withdraw from the course, per the University Academic Regulations.

Who teaches it

–Volker Genz
Volker Genz
Office 216

Files

syllabus
Introduction to Number Theory and Cryptography
Introduction to Number Theory and Cryptography · Spring 2026
Open

What Anonymous says

Anonymous posts, unverified. Press F never edits them and every card links to the original.