Building Confidence in Cryptographic Protocols

This post introduces the concept of formal analysis and mathematical proofs for cryptographic protocols, using KEMTLS as an example. It explains how process algebras and tools like Tamarin are used to model protocols, represent rules, and generate trees of all possible protocol runs. The goal is to demonstrate the security of protocols by showing that no 'bad' runs exist within these trees, providing a rigorous method for building confidence in cryptographic designs, especially in the context of post-quantum cryptography.