Lattices and Michigan Football with Chris Peikert
Security Cryptography Whatever
00:00
The Shortest Vector Problem in Cryptography Isn't Empty Hard
In order to break a crypto system, you often don't have to find exactly the shortest fector in the lattice. It's sufficient to find one which is pretty close to the shortest or something like that. This notion of li there being an approximately shortest vector that you have to find is no permeating all of latis crypto,. Whether it's l w e or whether it's s.
Transcript
Play full episode
