(T) Researchers have been working on quantum encryption for a long time. Quantum encryption is based on quantum key distribution (QKD). QKD algorithms can leverage well-defined quantum states (or photon polarization states) that have to be transmitted in the key distribution protocol, or quantum entanglement (entangled pairs of photons), where the encryption key comes into existence at different locations simultaneously due to measurements on the individual participants of the entangled quantum system.
The encryption key generated using QKD is generally applied to encrypt the data using a symmetric key algorithm such as AES-256. One of the great benefits of quantum encryption is that it can detect eavesdropping.
While the properties of quantum mechanics can be used to generate encryption keys, quantum computers can break classical public key encryption.
A quantum computer running the Shor’s algorithm for integer factorization can break the RSA scheme (based on integer factorization). And a variant of the Shor’s algorithm can break other schemes based on discrete logarithms such as the Diffie-Hellman and Elliptic Curve Cryptography (ECC) algorithms.
However, note that most current private key algorithms are considered to be relatively secure against attacks by quantum computers.
To mitigate the future risks of quantum computers breaking-up public key encryption, the NSA, and more recently Google, have announced various efforts for “quantum-resistant” algorithms. The NSA published a report on that subject, and Google has just announced, on a blog post, that in addition to the elliptic-curve key-exchange algorithm for Chrome connections to Google back-end servers, Google will also implement New Hope, a post-quantum key exchange algorithm.
Note: The picture above is from my garden.
Copyright © 2005-2016 by Serge-Paul Carrasco. All rights reserved.
Contact Us: asvinsider at gmail dot com.