Celebrated Cryptography Algorithm Gets an Upgrade

quantamagazine.org

57 points·digital55··5 comments

The paper in question[1]. This will make some practical attacks faster, e.g. the recent attack on some SSH & IKE implementations[2] which misused RSA-PKCS#1v1.5.

[1] https://eprint.iacr.org/2023/237

[2] https://eprint.iacr.org/2023/1711

This is super helpful context for this article, and also one of the best pieces of technical writing I've ever read:

https://kel.bz/post/lll/

We talked to Martin Albrecht on the podcast a few weeks ago about the attack model on lattice cryptography (like Kyber, the NIST PQC winner); lattice basis reduction is central to that attack.

> on the podcast

Click username => Check website, last update 2016...

Copy the @_@_ junk to a search engine => Click on Mastodon instance, unable to find any link to "the podcast" in the "profile" => scroll through Mastodon posts, wading through food swooning and memes to find December 2nd ~"SEND US QUESTIONS FOR SCW PODCAST" => put "SCW Podcast" in search engine => Scroll past "SCW Fitness" and "Soft Cock Week"...

Put "SCW Security" into search engine => Click https://securitycryptographywhatever.com/

https://securitycryptographywhatever.com/2023/11/13/lattice-...

Sorry, I legit just forgot to paste a URL there, I do not in fact think random readers here are familiar with a weirdo podcast I'm on.

Code for the new algorithm: https://github.com/keeganryan/flatter

It does indeed perform better than traditional LLL for some classes of matrix, and serves as a nice drop-in replacement for those problems. It doesn’t always seem to yield a speedup though, and the program is prone to crashing sometimes. Such is academic code…

Reply on news.ycombinator.com