Stories
Slash Boxes
Comments

SoylentNews is people

posted by Fnord666 on Thursday December 20 2018, @06:54AM   Printer-friendly
from the for-sufficiently-large-polynomials dept.

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


Original Submission

 
This discussion has been archived. No new comments can be posted.
Display Options Threshold/Breakthrough Mark All as Read Mark All as Unread
The Fine Print: The following comments are owned by whoever posted them. We are not responsible for them in any way.
  • (Score: 0) by Anonymous Coward on Thursday December 20 2018, @05:51PM

    by Anonymous Coward on Thursday December 20 2018, @05:51PM (#776875)

    Quantum computing appears to only be mentioned by the submitter. TFA does not say anything about it, and neither does the actual paper which does not even mention RSA at all.