RSA Public-Key Cryptography
Lesson notes
Overview
Multiply two primes to make a public key; recovering them to decrypt is believed infeasible. This topic is rated advanced and is number 56 of 117 in Computer Science. Deeper models, formal results and harder reasoning.
What you are seeing
The panel above shows an interactive animation of the idea. Every slider changes one quantity so you can see its effect on the outcome. The animation is drawn live from the model, so everything you see responds to the sliders. Press Space to pause, use Restart to replay from the start, and change the speed to slow down quick events.
In depth
In RSA, a user picks two large primes p and q, publishes their product n and an exponent e as the public key, and keeps the private exponent derived from p and q secret. Anyone can encrypt a message m as c = mᵉ mod n, but decrypting needs the private key, which is believed to require factoring n, a task that is infeasible for numbers with hundreds of digits. It allows secure communication without a shared secret and is used for digital signatures.
Reading the relationship
The expression "c = mᵉ mod n" is a compact summary of the idea. It uses the symbols c, m, o, d, n; name what each one stands for before you start. Then use the sliders to see how changing one quantity changes the others.
A guided exploration
1. Run the animation once with the default settings and describe in words what happens. 2. Change one slider at a time and note which quantity responds most. 3. Push each slider to its extreme and decide whether the result still makes sense.
Try this
Try to explain why the pattern holds, not just what it is. Look for limiting cases and what happens at the edges.
Common pitfalls
Test small inputs by hand and then the largest ones. Off-by-one errors and forgetting how cost grows with input size are the most common traps.
How it connects
It builds on “Caesar Cipher”, the topic before it in Computer Science. Once you are comfortable, continue with “Cryptographic Hash Functions”.
Why it matters
Computing ideas decide how fast, how safely and how well software can solve problems.
Where you might use it
- Revising “RSA Public-Key Cryptography” before a class, exam or certification
- Choosing the right algorithm or data structure when writing software or apps
- Debugging programs and judging how fast or how safely code will run at scale
- Understanding how search engines, games, phones and AI systems make decisions
Frequently asked questions
What is RSA Public-Key Cryptography?
Multiply two primes to make a public key; recovering them to decrypt is believed infeasible. It is an advanced topic in Computer Science.
How do I use the RSA Public-Key Cryptography simulation?
The panel at the top shows an interactive animation of the idea. Every slider changes one quantity so you can see its effect on the outcome. Move the sliders one at a time, then press Space to pause the animation and look closer.
What does the formula mean?
The expression c = mᵉ mod n packs the idea into symbols. Name each symbol first, then change one quantity with the sliders and see which others respond.
Who is this topic for?
Deeper models, formal results and harder reasoning. If the quiz feels hard, reread the lesson notes and try the previous topic first.
What should I learn before this?
Start with “Caesar Cipher”, the previous topic in Computer Science. Each topic in a subject builds on the ones before it.
How do I track my progress?
Press “Mark as learned” on this page. Progress is stored only in this browser and is never sent anywhere. The Browse page can show topics you have learned or still need to learn.
Quick quiz
More in Computer Science
See all →Cryptographic Hash Functions
Change one input bit and about half the output bits flip — the avalanche effect.
XOR Encryption and One-Time Pads
XOR with a random key is unbreakable if the key is truly random and used once.
How a Web Request Works
A browser resolves a name, opens a connection and fetches a page.