Thirty Years Later, a Speed Boost for Quantum Factoring | Quanta Magazine

This is the most overlooked consideration when people talk about how many logical qubits are required to break the encryption we use for digital signing.

Yes, 30 years ago Shor showed us one potential method that imposed risk. Sadly, people seem to think it is the only method.

But there hasn't been a lot of people trying to find faster methods using quantum computing.

The article share one example of a faster approach. Martin Ekera also published Quantum algorithms for computing short discrete logarithms and factoring RSA integers in 2017.

So, we now see error correction advancements, multiple scaling approaches, hybrid models, major money, and improving mathematical methods.

This is why Apple and Google have already been upgrading encryption. And the white house and EU signed orders to start preparing.

Vitalik outlined an a plan in case of an emergency and I hope he is looking at a non emergency implementation.

Btc should be doing the same.

It's not trivial and there will be difficulties/impacts.

All systems will need to deal with this (and yes, the banks and military and every other important system are actively preparing).

Starting now will allow for good decisions to minimize impacts.

Decentralized systems face much bigger challenges in implementing changes. Especially since solutions likely require users to take action with their wallets to transition to secure signing methods.