Since we recorded and uploaded this the Closest Vector Problem has gotten to O(n^{1/2-ε}) and then Classic McEliece distinguisher and key recovery have significantly weakened prod parameter sets 😅
NEW EPISODE! Lattices! New complexity results in the closest vector problem & a possible poly-time quantum attack against the dihedral coset problem that made everyone freak out for about a week; ALSO there's a distinguisher attack against Classic McEliece 😱 youtu.be/7_Db0LXQrk0
2 reposts8 likes