Root Causes 608: The Fragility of Formal Verification
From Root Causes: A PKI and Security Podcast by Tim Callan and Jason Soroko
April 22, 2026 · 8 min · Episode 608
About this episode
This episode discusses the challenges of proving the reliability of cryptographic algorithms due to formal verification difficulties and other weaknesses.
The reliability of cryptographic algorithms is largely a matter of conjecture based on track record. Proving security is impaired by the difficulty of formal verification, implementation weaknesses, and failure in randomness.
Topics covered
- cryptographic algorithms
- formal verification
- security
Keywords
- reliability
- conjecture
- implementation weaknesses
- randomness
More episodes of Root Causes: A PKI and Security Podcast
- Root Causes 607: PKI That's Hard to Discover · April 20, 2026 · 8 min
- Root Causes 606: What Is the UK Online Safety Act? · April 17, 2026 · 6 min
- Root Causes 605: Chrome Declares Its Support for Merkle Tree Certificates (MTC) · April 15, 2026 · 9 min
- Root Causes 604: Accelerated Timeline for Quantum Computers Breaking ECC in Crypto and Blockchain · April 13, 2026 · 11 min
- Root Causes 603: Cryptographically Relevant Quantum Computing (CRQC) with Only 10,000 Qubits · April 10, 2026 · 9 min
- Root Causes 602: Google Moves the PQC Date Forward to 2029 · April 8, 2026 · 13 min
Explore listener stats, chart rankings, contacts and more on the Root Causes: A PKI and Security Podcast podcast page.