A fast quantum mechanical algorithm for database search
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
SIAM Journal on Computing
| Hi-index | 0.00 |
The strength of our current encryption systems is based on cryptographic keys and complex mathematical algorithms. Using a sufficiently long cryptographic key, a mathematical algorithm transforms plaintext into ciphertext in such a way as to make it computationally infeasible for a cryptanalyst to determine either the enciphered message or the underlying key. An implicit assumption is that computer technology, as we know it, is used throughout this process. But what if a different type of computer - one based on quantum physics rather than classical mechanics - was used?