Mathematics I / Primes and the Fundamental Theorem of Arithmetic
Practice question · Multiple choice

RSA encryption relies on multiplying two large primes being easy while factoring the product is hard. Why is that asymmetry the whole security model?

Hints
  1. Ask what you need to encrypt a message, and what you need to read one.
  2. The product is published deliberately. Why is that safe?
Show the answer

B. Because the public key is the product and the private key the factors

Why

The product is public and the factors are the secret, so a one-way gap becomes an asymmetry between sending and reading. Option 4 overstates it dangerously: factoring is not proved hard, merely not known to be easy, and Shor's algorithm factors efficiently on a quantum computer, which is why post-quantum cryptography exists.

Read the lesson: Primes and the Fundamental Theorem of Arithmetic →

Practise Primes and the Fundamental Theorem of Arithmetic

The app has 5 more questions on this lesson, and keeps your place in the course. Mathematics I is free to start.

More questions on Primes and the Fundamental Theorem of Arithmetic