3 ms·
On 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
by john_alan 5y ago
On 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.