Why do we think anything is secure, with Steve Weis

Episode notes

What does P vs NP have to do with cryptography? Why do people love and laugh about the random oracle model? What's an oracle? What do you mean factoring and discrete log don't have proofs of hardness? How does any of this cryptography stuff work, anyway? We trapped Steve Weis into answering our many questions. Transcript: Links: - The Random Oracle Methodology, Revisited: - Factoring integers with CADO-NFS: - On One-way Functions from NP-Complete Problems: - Seny Kamara's lecture notes on provable security: - How To Simulate It - A Tutorial on the Simulation Proof Technique: - A Survey of Leakage-Resilient Cryptography: - A Decade of Lattice Cryptography: "Security Cryptography Whatever" is hosted by Deirdre Connolly (@durumcrustulum), Thomas Ptacek (@tqbf), and David Adrian (@dadrian)

Related episodes across the Index

Other episodes covering the same guests and topics, from across The B2B Podcast Index.

• Why Circle’s CEO Says Stablecoin Regulation Is Essential | Leadership NextLeadership Next · on Cryptography80 / 100
• Max Levchin - Building Affirm, PayPal, and Why He Only Starts Network BusinessesFintech Leaders · on Cryptography79 / 100
• Shut Up and Take My Money: Time-Traveling Satoshi Nakamoto and the Luxury 'G'-TrainPitch It · on Cryptography31 / 100
• Announcing Building 32, from MIT CSAIL AlliancesBuilding 32 · on Cryptography27 / 100
• Designing for Harsh Environments & Quantum CryptographyEmbedded Insiders · on Cryptography

• An Odyssey of Lattice Cryptography with Mark Schultz-Wu95 / 100
• Trump's Golden Post-Quantum EO(s)80 / 100
• Facing the Vulnpocalypse with lcamtuf95 / 100
• AI Finds Vulns You Can't With Nicholas Carlini100 / 100
• Standardizing Pure PQC27 / 100