“Computationally Infeasible”

The hub-bub to-do with quantum computers and encryption lays in the computational difference between the quantum and the classical computer processing power. Today’s confidentiality for data-in-transit across the internet relies upon the computational infeasibility of cracking the encryption. (It would take too long to break the code with classical computers). The advent of quantum computing will significantly reduce the time to crack the encryption codes. Quantum key distribution (QKD), a method of distributing secret keys between two parties, is possible – today – in enabling perfect secrecy between two-parties. Researchers have recently shown this ability to maintain perfect secrecy over fiber-optic wires. Read on for more and a link to the original study. 

This article is found at U of T Engineering News…

Share this article ...

Our Mission

At The Qubit Report, our mission is to promote knowledge and opinion of quantum computing from the casual reader to the scientifically astute.  Because Quantum is Coming.

Einstein Stroll