For each of the following

PHYSICS · Multi-part · Fermi University Physics · Quantum Information & Technology · The quantum circuit model and quantum algorithms · The quantum circuit model and quantum algorithms

Quantum Information and Technology, Ch Order finding and Shor's factoring algorithm

Problem

For each of the following, say whether a large-scale order-finding quantum computer would break it, and give a one-sentence reason: ((a)) RSA-2048 public-key encryption. ((b)) Diffie-Hellman key exchange over a large prime finite field. ((c)) Elliptic-curve Diffie-Hellman key exchange. ((d)) AES-256 symmetric encryption with a securely shared secret key. ((e)) A one-time pad with a securely shared secret key.

Browse the problem library