Prime Numbers
Public Key Encryption
RSA Algorithm
Real-Life Applications
Fun Facts & Future
100

What is a prime number?


A number greater than 1 that can only be divided by 1 and itself

100

What are the two keys used in public key encryption?

A public key and a private key.

100

What does RSA stand for?

Rivest, Shamir, and Adleman

100

Where are prime-based systems used online?

In HTTPS, online banking, messaging apps, etc.

100

When was RSA invented?

In the 1970s.

200

Why are primes called the “atoms” of mathematics?

Because all other numbers can be built from them through multiplication.

200

What is the purpose of the public key?

To encrypt messages.

200

What is the first step in generating RSA keys?

Choose two large prime numbers, p and q.


200

What protocol secures websites?

SSL/TLS.

200

What new type of computer threatens prime-based cryptography?

Quantum computers.

300

Give three examples of prime numbers under 20.

2, 3, 5, 7, 11, 13, 17, 19.

300

What is the private key used for?

To decrypt messages.

300

What is n in RSA encryption?

The product of p × q.

300

Which popular messaging apps use encryption?

WhatsApp and Signal.

300

What is being developed to resist quantum attacks?

Post-quantum cryptography.

400

Why are prime numbers important in cryptology?

They make encryption hard to reverse (factorization is difficult).

400

Why can’t hackers easily find the private key?

Because it requires factoring a huge number into its prime factors.

400

Why is RSA secure?

Because factoring n into p and q is extremely hard.

400

What role do primes play in cryptocurrencies?

They help generate secure cryptographic keys.

400

Why are prime numbers considered “mysterious”?

Because they appear irregularly and infinitely, with no clear pattern.

500

What makes factoring large numbers so challenging?

Because no efficient algorithm exists to factor very large numbers quickly.

500

What mathematical property links the two keys?

Both are based on the same pair of large prime numbers.

500

In the example with p=3 and q=11, what is n?

n = 33.

500

What could happen if encryption based on primes stopped working?

Online transactions, messages, and data would no longer be secure.

500

What makes cryptology a fascinating field?


It connects pure math with real-world digital security.