Knowledge check

RSA & public-key cryptography

10 questions testing what you just read — no login, no tracking, just immediate feedback.

Question 1 of 10

Why is the public exponent e = 65537 used in almost every RSA key?

Question 2 of 10

What is RSA typically used for in practice, rather than encrypting bulk data directly?

Question 3 of 10

What mistake makes RSA's common modulus attack possible?

Question 4 of 10

What problem does public-key cryptography solve that symmetric cryptography alone can't?

Question 5 of 10

What is φ(n) (Euler's totient) in RSA key generation, and why can only the key-holder compute it easily?

Question 6 of 10

In the module's worked example (p=61, q=53), what is the RSA modulus n?

Question 7 of 10

What algorithm efficiently finds the private exponent d from e and φ(n)?

Question 8 of 10

In RSA signing, whose key produces the signature, and whose key verifies it?

Question 9 of 10

What does Håstad's broadcast attack exploit?

Question 10 of 10

What is the largest RSA modulus size considered securely unfactored for the foreseeable future, per the module's factoring-record timeline?

0 / 10 answered