4 ms·
> >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 a
by cyphar 10y ago
> >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.
- PeCaN 10y agoShor'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.
- serendipitous 10y agoThe 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).