IA ideas library

Cryptography and number theory IA ideas: codes, primes and modular arithmetic

Codes and ciphers are a natural home for pure mathematics with a purpose: modular arithmetic, prime numbers, counting arguments and proof. You can break a cipher with letter frequencies, prove why a check digit catches typing mistakes, or count how many keys an attacker would have to try.

Most of this mathematics is beyond the IB syllabus, which makes it a good fit for confident AA students, especially at HL where proof is expected. Keep the scope small: one idea understood and proved is worth more than a tour of famous ciphers.

Next step: shortlist ideas with the free IA topic explorer, which filters starting points by course, interest and how easy the data is to get. For feedback on your own draft, the IA package (€39 once) gives you 5 AI feedback credits and every annotated exemplar in full.

Caesar cipher wheel with the alphabet on the outer ring and the alphabet shifted three places on the inner ring, showing x maps to x + 3 modulo 26
A Caesar shift is addition modulo 26: the starting point for modular arithmetic in a cryptography IA.

How cryptography explorations reach the top bands

Personal engagement (C)

Build and break your own small cipher or code, invent examples to test each result, and record the conjectures you made and the ones that turned out to be false.

Reflection (D)

Reflect on what each result guarantees and what it doesn't: which errors a check digit misses, which attacks a cipher survives, and how the answer depends on the size of the numbers.

Use of mathematics (E)

SL: Counting principles, probability or frequency statistics used correctly; any number theory (modular arithmetic, primes) introduced with your own small worked examples and explained, not quoted.

HL: Rigorous proofs (by contradiction or induction) of the number-theory facts you rely on, counting arguments made general, or a statistical attack tested formally.

An HL version

Prove the key result in general (why the check digit catches every single-digit error, why the decryption undoes the encryption) rather than checking examples.

Cryptography & number theory ideas (9)

Also relevant (4)

Frequently asked questions

Is RSA too hard for a Maths IA?

RSA needs modular arithmetic, Euler's totient function and modular inverses, none of which are in the syllabus. It is possible at AA HL if you build the ideas up carefully with small numbers. Smaller questions, such as check digits or affine ciphers, are easier to make rigorous.

Can AI students do a cryptography IA?

Yes, especially a statistical one: frequency analysis with a chi-squared goodness-of-fit test, or the probability of guessing a password. Make sure the mathematics you use is at the level of your course.

Start your IA plan, free

Answer the planning questions: your question, the maths, the data and milestones back from your deadline. Then take it to your first teacher meeting.

Plan my IA free

Your plan is kept in this browser. A free account keeps it with your drafts on any device: Join free · Sign in

Related types of IA: Pure maths, number & proof

Other topics: Modelling · Calculus · Differential equations · Statistics · Probability · Geometry & Voronoi · Finance · Sport · Environment · Health & biology · Networks & graphs · Pure maths · Art & music · Games & puzzles · Optimisation · Simulation · Numerical methods · Fractals & chaos · Matrices & Markov · Trig & navigation · Kinematics · Voting & game theory · Surveys

By interest: Computer science · Physics and engineering · Psychology and social sciences · Geography and travel · Chemistry · Biology · Economics · Business management · Sports, exercise and health science · Environmental systems and societies · Music · Visual arts · Design technology · By course: AA SL · AA HL · AI SL · AI HL