Steve Bellovin on Nostr: There's a preprint (), not yet peer-reviewed, for what claims to be a polynomial time ...
There's a preprint (
https://eprint.iacr.org/2024/555), not yet peer-reviewed, for what claims to be a polynomial time algorithm for breaking lattice-based encryption algorithms. I'm by no means qualified to even understand it, but it's very important for post-quantum algorithms if it holds up.
Published at
2024-04-18 21:59:25Event JSON
{
"id": "bdc13e024485dc201cdae14285f652bc42ce7c749cfa09bd7fae6ac1facab74a",
"pubkey": "6da2523d22fe20b9e224d3a3faa0a966295e43c7eb7e55e99dff4b76a9fa0a5a",
"created_at": 1713477565,
"kind": 1,
"tags": [
[
"proxy",
"https://mastodon.lawprofs.org/users/SteveBellovin/statuses/112294465759438059",
"activitypub"
]
],
"content": "There's a preprint (https://eprint.iacr.org/2024/555), not yet peer-reviewed, for what claims to be a polynomial time algorithm for breaking lattice-based encryption algorithms. I'm by no means qualified to even understand it, but it's very important for post-quantum algorithms if it holds up.",
"sig": "f6e8271321f85f87e41e2c86aabc38579d44757b8454561c22f75f508b468c98f5e003d1e93e148e9629f1fc80625a1806759958ac006e9a422e19f137c0b695"
}
