3 ms·
Will quantum computers be able to hack the bitcoin algos in a decade?
by mmargerum 5y ago
Will quantum computers be able to hack the bitcoin algos in a decade?
- Jeff_Brown 5y agoAnything based on RSA, factoring primes, will be vulnerable. There are lots of forms of encryption which no quantum algorithm is known to process faster -- I believe elliptic key crypto is one. I don't know whether any cryptocurrency uses such alternative encryption schemes.
- Jeff_Brown 5y agoSorry, factoring into primes. Factoring primes is easy. I can factor a million-digit prime myself by hand.
- tromp 5y agoQuantum Computers solve ECDLP just as easily as factoring.
- tromp 5y agoThat seems exceedingly unlikely. I think it's more likely someone finds an efficient classical ECDLP (Elliptic Curve Discrete Log Problem) solver in 5 years...
- john_alan 5y agoOn what basis do you think that the ECDLP will be solved in polynomial time in a classical context? I would expect we will more likely have an error-correcting quantum machine sooner than the aforementioned. Given the pace Google et al are making. We already have a quantum approach to solved ECC over finite fields, Shor's.
- tromp 5y agoI don't think it will. But having quantum computers able to crack 256-bit ECDLP in only 5 years seems even more far fetched.