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.
Infos pratiques
Prochains exposés
-
Dissecting CRAFT, a full-round attack
Orateur : Eran Lambooij - Inria
I will present the first full-round key recovery attack on CRAFT, a block cipher introduced at ToSC 2019. The attack builds on the previous observation (ToSC 2026) that the state of CRAFT can be decomposed into two parts that barely exchange information. We transform this property into a dissection attack on the full-round cipher. This shows that in some cases we can elevate the dissection attack[…]-
Cryptography
-
-
Key Attack on the ACDGV Matrix Encryption Scheme
Orateur : Anmoal Porwal - Technical University of Munich
I will present our key-recovery attack on the ACDGV public-key encryption scheme proposed at ASIACRYPT 2024 by Aragon, Couvreur, Dyseryn, Gaborit, and Vinçotte. The secret key is a Gabidulin code hidden by appending random rows and columns and by left- and right-multiplication with invertible matrices. Our attack exploits the resulting algebraic structure to recover an equivalent secret key. It[…]-
Cryptography
-
Asymmetric primitive
-
-
Module Learning With Errors and Structured Extrapolated Dihedral Cosets
Orateur : Jinwei Zheng - Télécom Paris
The Module Learning With Errors (MLWE) problem is the fundamental hardness assumption underlying the key encapsulation and signature schemes ML-KEM and ML-DSA, which have been selected by NIST for post-quantum cryptography standardization. Understanding its quantum hardness is crucial for assessing the security of these standardized schemes. Inspired by the equivalence between LWE and[…]-
Cryptography
-