https://arstechnica.com/information-technology/2023/01/fear-not-rsa-encryption-wont-fall-to-quantum-computing-anytime-soon/ https://arstechnica.com/information-

https://arstechnica.com/information-technology/2023/01/fear-not-rsa-encryption-wont-fall-to-quantum-computing-anytime-soon/ https://arstechnica.com/information-technology/2023/01/fear-... 22 bits is in the range that it could be factored by hand, with the aid of some prime number tables. According to the article, they used D-wave's quantum annealing, which models optimization problems, not Shor's algorithm, so it's not clear how they used quantum effects (except for publicity). Also from the same publication a year ago: https://www.csoonline.com/article/574717/can-a-quantum-algorithm-crack-rsa-cryptography-not-yet.html https://www.csoonline.com/article/574717/can-a-quantum-algor...