Sean Cheetham and Sophia Dew examine a reported AI-assisted result against a cryptographic candidate. Sean Cheetham distinguishes weakening a proposed construction from breaking widely deployed encryption, and describes the importance of security margins, underlying hardness assumptions and human-guided research.
Sean Cheetham discusses post-quantum algorithms and explains that different constructions depend on different mathematical assumptions. His estimates of quantum-computing timelines are presented as expectations, not verified deadlines, while the engineering lesson is to prepare alternatives before a rushed migration becomes necessary.
Sean Cheetham and Sophia Dew discuss cryptographic agility across software, hardware and blockchains. Replacing an algorithm requires careful implementation and coordination, and near-term vulnerabilities can arise from ordinary software bugs even when the mathematical design remains sound.
Watch on YouTube
