AI-powered
podcast player
Listen to all your favourite podcasts with AI-powered features
Episode 59: STARKs & StarkWare with Eli and Alessandro
Zero Knowledge
Are Snarks Not Post Quantum Secure
3min Snip
00:00
Summary
Transcript
Episode notes
The cryptographic hardness ultimately relies on something called the discrete logarithm problem over you know finite rebellion groups. Under suitable settings classical algorithms are believed not to be able to do this so quantum computers can efficiently break such systems like RSA defeat helman key exchange elliptic curve cryptography. The snarks used by zcash as well as other recent suggestions such as the beautiful bulletproofs as your knowledge system rely on such hardness assumptions and they are known to be attackable by quantum computers.
Get the Snipd
podcast app
Unlock the knowledge in podcasts with the podcast player of the future.
AI-powered
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