Chris Peikert
@ChrisPeikert
Cryptographer (lattices/post-quantum), Professor @UMichCSE, CS(cientific)O @AlgorandFoundation, PhD @MIT_CSAIL. Previously @gatech_scs. Here I speak for myself.
58 Following 6.9K Followers
1/ Initial reactions after some hours with this groundbreaking result proving the NP-hardness of poly-approx CVP/NCP:
It is most likely correct, but more importantly, it is original, elegant, and beautiful!
(Also: it is easy to improve, quantitatively.)
Show more
WOW!! 🤯
Among many jaw-dropping results, this proves NP-hardness of the Closest Vector and Nearest Codeword Problems for *polynomial* approximation factors, for the first time ever, and via a totally new approach (Reed-Solomon techniques). Amazing!
Show more
