Maths EE ideas library
Maths Extended Essay ideas: codes, cryptography and algorithms
Error-correcting codes, ciphers, numerical methods and the mathematics of algorithms. These link naturally to computer science but must stay mathematical.
Codes, cryptography and algorithms ideas (9)
- Why RSA encryption worksCodes & algorithmsSolid
- Correcting errors with Hamming codesCodes & algorithmsSolid
- Check digits: which errors do they catch?Codes & algorithmsAccessible
- Sharing a secret in publicCodes & algorithmsSolid
- Breaking substitution ciphers with statisticsCodes & algorithmsAccessible
- Why the fast Fourier transform is fastCodes & algorithmsAmbitious
- How many comparisons does sorting need?Codes & algorithmsSolid
- Ranking web pages with eigenvectorsCodes & algorithmsAmbitious
- How random are pseudo-random numbers?Codes & algorithmsSolid
Research questions to start from
One starting question for each idea. Change the case, the comparison or the limit until it is yours.
- Why RSA encryption works Solid
- Why does RSA decryption recover the message, and how does its security depend on the difficulty of factorising? Number theory with a working system you can build by hand and prove correct.
- Correcting errors with Hamming codes Solid
- How do Hamming codes detect and correct single-bit errors, and why are they the most efficient codes that can? Linear algebra over {0,1} with a sharp optimality result (perfect codes).
- Check digits: which errors do they catch? Accessible
- Which typing errors are always detected by the ISBN-10 and ISBN-13 check-digit systems, and why does the choice of modulus matter? Precise, provable statements about detection, with a design comparison.
- Sharing a secret in public Solid
- How does Diffie–Hellman key exchange let two people agree a secret over a public channel, and why does its security rest on the discrete logarithm problem? Group theory and modular arithmetic in a protocol you can analyse step by step.
- Breaking substitution ciphers with statistics Accessible
- How reliably can a substitution cipher be broken by letter-frequency analysis, and how much ciphertext is needed? Statistics applied to a decoding method you evaluate quantitatively.
- Why the fast Fourier transform is fast Ambitious
- How does the fast Fourier transform reduce the work of a discrete Fourier transform from about n² to about n log n operations? Roots of unity and recursion combine into a provable speed-up.
- How many comparisons does sorting need? Solid
- Why does any comparison sort need about n log₂ n comparisons in the worst case, and how close do merge sort and insertion sort come? A lower bound proof (decision trees) and exact counts for real algorithms.
- Ranking web pages with eigenvectors Ambitious
- How does the PageRank method rank pages in a small network, and why does the damping factor guarantee a unique ranking? Markov chains and eigenvectors with a clear theoretical question about uniqueness.
- How random are pseudo-random numbers? Solid
- How does the choice of parameters determine the period of a linear congruential generator, and how can its output be tested for randomness? Number theory proves the period conditions; statistics tests the output.
Frequently asked questions
Is codes, cryptography and algorithms a good area for a maths EE?
It can be, if you narrow it to one question you can answer with mathematics you understand. Explain why the algorithm works and how well it performs, with proofs or error bounds. Code alone is not mathematics.
Can I use one of these research questions as it is?
Use it as a starting point. Change the case, the comparison or the limit until the question is your own, and agree it with your supervisor.
Other areas: Number theory · Algebra · Analysis & calculus · Geometry · Probability · Statistics · Modelling · Graph theory · Optimisation & games · History of maths