News for hackers. Stuff that matters.

A comment on Quintuple: a Python 5-qubit quantum computer simulator. Parent comment

Re:Quintuple: a Python 5-qubit quantum computer simulator by cyphar on Saturday July 16, 2016 @06:47PM (#12108167)
> >Factorization for example, that's why public key encryption works (we can't brute force it), but a quantum computer could.

> Most (all?) modern public key algorithms are not based on the integer factorization problem.

There are analogues for Shor's algorithm for the discrete logarithm and other similar problems.

[ Parent | on HN ]
Re:Quintuple: a Python 5-qubit quantum computer simulator by PeCaN on Sunday July 17, 2016 @12:59AM (#12109078)
Shor's algorithm covers discrete logarithm also.

But most modern asymmetric algorithms are based on elliptic curves and other problems that quantum computers don't help with.

[ Parent | on HN ]
Re:Quintuple: a Python 5-qubit quantum computer simulator by serendipitous on Sunday July 17, 2016 @11:46PM (#12113130)
The ECC algorithms used today rely on the "Elliptic Curve Discrete Logarithm Problem" and are very much vulnerable to (a version of) Shor's algorithm. Some would even say they are more vulnerable than RSA due to the much smaller key sizes (requiring less qubits).
[ Parent | on HN ]