Formal verification has been used to prove the security of cryptographic protocols like Signal and TLS – but can it also be used to verify the correctness of legislation? Denis Merigoux tells us about how Catala wants to use formal methods to verify the French tax code.
Jack O'Connor and Jean-Philippe Aumasson discuss how Merkle Trees make the new BLAKE3 hash function special, and talk about the design process for the BLAKE family of hash functions in general.
Léo Perrin talks about how his team at INRIA was able to find serious breaks in the Gimli family of lightweight symmetric primitives, and why NIST's lightweight cryptography competition even matters in the first place, especially with block ciphers like AES dominating the industry.
KEMTLS is a modified version of TLS 1.3 that uses Key Encapsulation Mechanisms, or KEMs, instead of signatures for server authentication, thereby providing a sort of “post-quantum TLS”. But what even are KEMs? Are quantum computers even a thing that we should be worried about? On the first ever episode of Cryptography FM, we’ll be hosting Dr. Douglas Stebila and PhD Candidate Thom Wiggers to discuss these questions and more.