all InfoSec news
New Lattice Cryptanalytic Technique
Schneier on Security www.schneier.com
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 …
algorithm algorithms base big cryptanalysis cryptographic cryptographic algorithms cryptography deal hard points post-quantum problems quantum quantum cryptography security things