From Quantamagazine
Digital security depends on the difficulty of factoring large numbers. A new proof shows why one method for breaking digital encryption won't work.
Virtually all polynomials of a certain type are "prime," meaning they can't be factored.
The proof has implications for many areas of pure mathematics. It's also great news for a pillar of modern life: digital encryption.
The main technique we use to keep digital information secure is RSA encryption. It's a souped-up version of the encryption scheme a seventh grader might devise to pass messages to a friend: Assign a number to every letter and multiply by some secretly agreed-upon key. To decode a message, just divide by the secret key.
Quite a statement by the researchers. This allegedly makes RSA encryption "quantum proof", and if so means that classical encryption may still be with us long after quantum computing arrives. Given that quantum systems require expensive entanglement setups, it may also mean that a cheap encryption method may stay viable.
Paper: Irreducibility of random polynomials of large degree
(Score: 2) by driverless on Thursday December 20 2018, @08:48AM
In addition, the Quanta author's "backdoor" was never a backdoor in the first place. In fact the only connection between the paper and RSA was the one made by the writer at Quanta magazine. So this sounds like not-very-much ado about nothing.