Under construction. This area is a framework being built: most courses have no teaching material yet, and things may change or break. Private self-study. Not an official programme and not recognised by any ministry or school. No qualification, mark or document is issued, and “years 1 to 3” and “advanced” are names of study paths only.
U11 Cryptography & coding
Years 1 to 3 pathU: Years 1 to 3 electivesplannedabout 120 h (planning estimate)
Draft lectures and exercises are available for this course. They were written by AI and checked by a second AI; no person has reviewed them yet. Use them as a study aid, not as an authority.
Named in: Years 1 to 3 pathway
Why this course
Algebraic constructions behind codes and cryptography, kept separate from security claims.
Prerequisites
Concept-level units
Units follow the syllabus order, as a recommended sequence rather than a gate.
- Modular arithmetic
- Finite-field computation
- Public-key constructions
- Security definitions introduction
- Error-correcting codes
- Limits of mathematical models
Assessable outcome
Explain algebraic constructions and distinguish mathematical correctness from security claims.
Assessment design
- topic exercises
- mixed problem sets
- unseen proof or derivation problems
- cumulative examination
cumulative; uses spaced retrieval
Resources
Every title here is candidate, unverified unless marked verified. Titles were suggested while planning. Nobody has checked that they exist, what they cost or how they are licensed.
- Hoffstein, Pipher and Silverman · An Introduction to Mathematical Cryptography
Content record
- Version
- 0.0.0
- Review
- no review of any kind
- Provenance
- catalogue imported from the owner brief of 29 Oct 2026; no teaching content authored
- Known issues
- none recorded
- Type
- course
Bridges and laboratories
No bridge or laboratory is attached to this course yet.
You and this course
Reading your plan on this device…