Amazon Researcher Claims Quantum Algorithm Could Challenge PQC Foundations
An Amazon Web Services cryptographer has published a paper detailing a quantum algorithm that could potentially challenge the security of lattice-based post-quantum cryptography. While the work is preliminary, it marks a significant theoretical step in quantum computing research.
Why it matters
If validated, this could force a re-evaluation of the encryption standards currently being developed to protect data against future quantum computer attacks.
A preliminary paper from an Amazon Web Services cryptographer describes a polynomial-time quantum algorithm for a long-standing mathematical problem whose solution could have implications for lattice-based cryptography, the foundation of many post-quantum encryption systems proposed by the National Institute for Standards and Technology , among others.
This is early work, but if validated, the work would represent a significant advance in quantum algorithms. It would not, however, amount to an immediate attack on deployed post-quantum cryptography.
The paper, written by Daniel R. Simon of Amazon Web Services ’ Cryptography Group, presents what it describes as a polynomial-time quantum algorithm for the Dihedral Coset Problem, or DCP. The problem has occupied quantum algorithm researchers for more than two decades because earlier work connected it to several difficult lattice problems.
Get smarter about the news
Sign up free for a feed built around what you actually care about, Dive Deeper research on any story, and the full text of every article.
Create free accountAlready have an account? Sign in