5 ms·
Someone please correct me if I'm wrong, but there's no proof that a general solution to elliptic curve discrete logarithm problem can't be found. It's reasonab
by notnullorvoid 1y ago
Someone please correct me if I'm wrong, but there's no proof that a general solution to elliptic curve discrete logarithm problem can't be found.
It's reasonable to assume that a solution hasn't been found yet though, otherwise that would be the world's best kept secret.
- wmf 1y agoThat's downstream of P vs NP.
- xoralkindi 1y agoShor's algorithm, originally designed for integer factorization, can also be adapted to solve the discrete logarithm problem in polynomial time on a quantum computer. There is also the less efficient Grover's algorithm can also be used for unstructured search problems on a quantum computer.
- notnullorvoid 1y agoI was thinking more along the lines of solving in polynomial time on a conventional computer.