Actually it's not quite that devastating. We don't have algorithms for solving any NP-complete problems in polynomial time on a quantum computer. What we have are algorithms for factoring and discrete log, which are basically the two problems at the heart of public key cryptography, and Grover's algorithm which halves effective key lengths for symmetric cryptography.
![[personal profile]](https://www.dreamwidth.org/img/silk/identity/user.png)
timeasmymeasure
no subject
Date: 2001-12-19 03:56 pm (UTC)