Short answer: Yes, but.
Quantum Computing and its threat to encryption is an extremely complex subject. I have therefore included detailed answers in a separate paper here (This link will either download the paper or open a new page, depending on your browser). As always, I have tried to simplify the subject for non-technical readers, who will find pages 1 and 4 useful.
The paper includes the pseudocode for "Shor's algorithm" and an illustration of how a Quantum Computer may solve the factorisation problem. It also explains why uncertainty on the timing of the threat will continue.
If you wish to discuss further, please DM.
Errata: Page 3 typo error: Instead of "322 are 522" it should say "323 to 511". My bad.
Image credit: Pixabay. DMCA: Contact me.
Santosh Pandit
3 January 2024
Go to the Blog Collection