Knowledge check

Why quantum computers break this: Shor's algorithm

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

Question 1 of 10

What did Shor's algorithm (1994) prove could be solved efficiently on a quantum computer?

Question 2 of 10

What is Grover's algorithm's effect on symmetric ciphers and hash functions?

Question 3 of 10

Roughly how many logical (error-corrected) qubits are estimated to be needed to break RSA-2048 with Shor's algorithm?

Question 4 of 10

In what year did Peter Shor publish his quantum algorithm for factoring and discrete logarithms?

Question 5 of 10

How does Shor's algorithm's running time grow with the size of the number being factored, compared to the best classical algorithm (GNFS)?

Question 6 of 10

Roughly how many qubits do today's largest quantum computers have?

Question 7 of 10

Which three algorithms make up NIST's post-quantum standards that replace RSA, Diffie-Hellman, and ECC?

Question 8 of 10

Does NIST's PQC migration replace AES and SHA-2/3, according to this module?

Question 9 of 10

What two classical hard problems does this module say RSA, Diffie-Hellman, and ECC all rest on being unsolvable efficiently?

Question 10 of 10

Can any quantum computer today run Shor's algorithm against real-world RSA/ECC key sizes?

0 / 10 answered