Solving the Shortest Vector Problem in $2^{0.6039n}$ Time via Mid-Point Hessian (arxiv.org)
23 points by sbulaev 8 days ago
slwvx 11 minutes ago
I was very happy to see an "AI use disclosure" right on the title page under the abstract.
It's not clear if this is solely a possible theoretical result or if it has any practical value. I.e. is it only useful on lattices that are so large as to not be of use, or could it be used for cryptanalysis? If one is using AI to generate a theory paper such as this, why not use the AI to also generate code that uses it, put it on GitHub, and show the results, say against fplll and the tool in the paper below?
GracefullyShot 35 minutes ago
could this be a problem for the security of Falcon (aka FN-DSA) post quantum signature scheme?
mswphd 11 minutes ago
not really. The hardness of SVP is relevant, but this is a paper giving improved provable bounds for SVP algorithms. heuristically (which people use to choose parameter sizes etc) people assume SVP is much easier to solve, closer to 2^{.29n + o(n)}.
So it's tangentially related, but does not itself imply an improvement on the (heuristically assumed) SOTA for these problems.
pretzellogician an hour ago
Wow, just yesterday I was thinking this exact problem would be a good candidate for AI. Seems it is!