A More Efficient Method for Breaking Elliptic Curve Cryptography (ECC) Using a Fault Tolerant Quantum Computer
Cracking cryptographic protocols is a well-known impact area for fault-tolerant quantum computing. Clearly it is important to estimate just when quantum computers will impact cryptography.
Shor's quantum factoring algorithm on a photonic chip
Shor’s quantum factoring algorithm finds the prime factors of a large number exponentially faster than any other known method, a task that lies at the heart of modern information security, particularly on the Internet. This algorithm requires a quantum computer, a device that harnesses the massive parellism afforded by quantum superposition and entanglement of quantum bits (or qubits). We report the demonstration of a compiled version of Shor’s algorithm on an integrated waveguide silica-on-silicon chip that guides four single-photon qubits through the computation to factor 15.
Author: Politi et al. Science 04 Sep 2009, Vol. 325, Issue 5945, pp. 1221 - Published: Sep 04, 2009
All authors: Alberto Politi, Jonathan C. F. Matthews, Jeremy L. O'Brien