3min chapter

Security Cryptography Whatever cover image

Lattices and Michigan Football with Chris Peikert

Security Cryptography Whatever

CHAPTER

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.

00:00

Get the Snipd
podcast app

Unlock the knowledge in podcasts with the podcast player of the future.
App store bannerPlay store banner

AI-powered
podcast player

Listen to all your favourite podcasts with AI-powered features

Discover
highlights

Listen to the best highlights from the podcasts you love and dive into the full episode

Save any
moment

Hear something you like? Tap your headphones to save it with AI-generated key takeaways

Share
& Export

Send highlights to Twitter, WhatsApp or export them to Notion, Readwise & more

AI-powered
podcast player

Listen to all your favourite podcasts with AI-powered features

Discover
highlights

Listen to the best highlights from the podcasts you love and dive into the full episode