←back to thread

191 points aorloff | 5 comments | | HN request time: 1.046s | source
1. EGreg ◴[] No.44467460[source]
On a side note, if quantum algorithms break elliptic curve cryptography, then wouldn’t Satoshi’s wallets and others be flooding the market with coin transfers?

The BTC network will need to require all addresses with large Bitcoin UTXOs to send them to new wallets, that are quantum-resistant, by a certain date, or lose the ability to move that money.

replies(1): >>44467904 #
2. notnullorvoid ◴[] No.44467904[source]
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.

replies(2): >>44468610 #>>44471890 #
3. wmf ◴[] No.44468610[source]
That's downstream of P vs NP.
4. xoralkindi ◴[] No.44471890[source]
Shor'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.
replies(1): >>44472850 #
5. notnullorvoid ◴[] No.44472850{3}[source]
I was thinking more along the lines of solving in polynomial time on a conventional computer.