News for hackers. Stuff that matters.

A comment on A Polynomial Time Bounded-Error Quantum Algorithm for Boolean Satisfiability. Parent comment

Re:A Polynomial Time Bounded-Error Quantum Algorithm for Boo... by im3w1l on Wednesday July 22, 2015 @07:31AM (#9928934)
This breaks a lot of cryptography. More than Shor's.
[ Parent | on HN ]
Re:A Polynomial Time Bounded-Error Quantum Algorithm for Boo... by marcosdumay on Wednesday July 22, 2015 @09:33AM (#9929505)
Just to add to the GP, this would break any cryptography algorithm that one can run on a classical computer.

Currently, quantum computers are believed to break only our most used algorithms, not all of them.

[ Parent | on HN ]