Description
From secure communications to online banking, cryptography is the cornerstone of most modern secure applications. Unfortunately, cryptographic design and implementation is notoriously error-prone, with a long history of design flaws, implementation bugs, and high-profile attacks. To address this issue, several projects proposed the use of formal verification techniques to statically ensure the safety, correctness, and security of high-performance cryptographic implementations.
In this talk, we will particularly focus on recent efforts targeting cryptographic implementations written in Rust. We will discuss the benefits of using Rust as a source language for formal verification, and present Aeneas, a novel verification framework which translates safe Rust programs to semantically equivalent functional models, notably in the Lean proof assistant. We will conclude with an overview of the broader Aeneas ecosystem and its integration in software development processes, as well as recent applications to the development and verification of post-quantum cryptographic implementations.
Practical infos
Next sessions
-
Endomorphisms via Splittings
Speaker : Min-Yi Shen - No Affiliation
One of the fundamental hardness assumptions underlying isogeny-based cryptography is the problem of finding a non-trivial endomorphism of a given supersingular elliptic curve. In this talk, we show that the problem is related to the problem of finding a splitting of a principally polarised superspecial abelian surface. In particular, we provide formal security reductions and a proof-of-concept[…]-
Cryptography
-