Re:Getting the World Quantum Ready
by garmaine on Thursday December 14, 2017 @03:34PM
(#15926725)
Yes, but bitcoin's authentication is via ECDSA. Elliptic curve discrete log is solvable with Shor's algorithm, but the qubit calculation would be different.
Wikipedia seems to indicate that 2330 qubits and 126 billion Toffoli gates would be required for elliptic curves with 256-bit group size, although I wonder if the endomorphism of secp256k1 gives an additional speedup.
Wikipedia seems to indicate that 2330 qubits and 126 billion Toffoli gates would be required for elliptic curves with 256-bit group size, although I wonder if the endomorphism of secp256k1 gives an additional speedup.