How RSA keeps payments secure: a maths EPQ idea
A title to start from
How does RSA encryption keep online payments secure, and what would it take to break it?
Why it works as an EPQ
The mathematics (modular arithmetic and primes) is learnable, small examples can be done by hand, and the security question needs a judgement.
Scope and difficulty
Solid. Solid. Work small examples fully; discuss real key sizes and quantum threats qualitatively.
The maths
Builds on these A Level topics: Proof · Algebra and functions.
You would learn:
- Modular arithmetic and inverses
- Fermat's little theorem and Euler's theorem
- Fast modular exponentiation
One possible plan
- Build RSA from the number theory, proving why decryption works.
- Encrypt and decrypt small examples by hand and in code.
- Time factorising numbers of growing size to show why security rests on it.
- Evaluate the threats, including quantum computing, from reliable sources.
Pitfalls
- Explaining the steps without proving why they work.
- Overstating quantum threats.
Where to start reading
- The Code Book (Simon Singh)
- Cryptography: A Very Short Introduction (Fred Piper and Sean Murphy)
Making something? Read the artefact guide first: an artefact still needs a research-based written report.
Similar ideas
- Which sorting algorithm is fastest?Which sorting algorithm is fastest in practice, and does Big O notation tell the whole story?
- How search engines rank pagesHow can matrices and probability rank web pages, and how could the ranking be manipulated?
- How QR codes survive damageHow can a damaged QR code still be read? The mathematics of error-correcting codes
- How compression makes files smallerHow can a file be made smaller without losing anything, and what is the limit?
All maths and computer science ideas · all 93 ideas
Your EPQ must be your own work. These pages coach: ideas, structure, checklists and planning. Submitting text, proofs, code or analysis written by someone else or by an AI tool as your own is malpractice. How to use help and AI honestly.