The RSA algorithm works because, when n is sufficiently large, deriving d from a known e and n will be an impractically long calculation — unless we know p, in which case we can use the shortcut.

And if the latter were able to break RSA, it would’ve already done so.” He concludes: “All told, this is one of the most actively misleading quantum computing papers I’ve seen in 25 years.” ...

RSA is currently doing an internal review of all of its products to see where the algorithm gets invoked and to change those. A company spokesman said the review is expected to be completed next ...

A quantum computer with a million qubits would be able to crack the vital RSA encryption algorithm, and while such machines don't yet exist, that estimate could still fall further ...

The previous RSA record was set in 2010, with a key of 232 decimal digits and 768 bits. “We were actually faster than the previous record, even though we computed something larger,” says Thomé.