Using EasyCrypt and Jasmin for post-quantum verification

This post introduces EasyCrypt and Jasmin as formal verification tools for ensuring the correctness and security of cryptographic implementations, particularly in the context of post-quantum cryptography. It details the goals of a formal analysis and verification process, distinguishing between formal analysis (proving specification properties) and formal verification (proving implementation correctness). The post explains the concept of indistinguishability games for modeling security goals and outlines a four-step process: formal specification, formal analysis, and formal verification of implementation correctness and additional properties like memory safety and constant-time execution. It highlights the benefits of computational analysis (EasyCrypt) over symbolic analysis (Tamarin) for detailed implementation verification, while acknowledging the potential for unwieldy computational models in complex protocols.