A new paper presents a polynomial-time quantum algorithm for solving certain hard lattice problems. This could be a big deal for post-quantum cryptographic algorithms, since many of them base their security on hard lattice problems.

A few things to note. One, this paper has not yet been peer reviewed. As this comment points out: “We had already some cases where efficient quantum algorithms for lattice problems were discovered, but they turned out not being correct or only worked for simple special cases.”

Two, this is a quantum algorithm, which means that it has not been tested. There is a wide gulf between quantum algorithms in theory and in practice. And until we can actually code and test these algorithms, we should be suspicious of their speed and complexity claims.

And three, I am not surprised at all. We don’t have nearly enough analysis of lattice-based cryptosystems to be confident in their security.

Leave a Reply

Your email address will not be published. Required fields are marked *

Explore More

Hackers Use Malware to Hunt Software Vulnerabilities

April 9, 2024 0 Comments 0 tags

Palo Alto Networks observed growing malware-initiated vulnerability scanning activity

Five Eyes Warn of Ivanti Vulnerabilities Exploitation, Detection Tools Insufficient

March 1, 2024 0 Comments 0 tags

Government agencies from the Five Eyes coalition said that Ivanti’s own tools are not sufficient to detect compromise

Half of IT Leaders Identify IoT as Security Weak Point

February 27, 2024 0 Comments 0 tags

The Viakoo study also said 50% firms faced IoT cyber incidents in past year, 44% of which were severe