This breaks a lot of cryptography. More than Shor's. | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

		im3w1l on July 22, 2015 \| parent \| context \| favorite \| on: A Polynomial Time Bounded-Error Quantum Algorithm ... This breaks a lot of cryptography. More than Shor's.

marcosdumay on July 22, 2015 [–]

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.

Consider applying for YC's Fall 2025 batch! Applications are open till Aug 4
Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact