Year: 2025
Type: conference-paper
Abstract: Jasmin is a programming language for high-speed and high-assurance cryptography. Correctness proofs of Jasmin programs are typically carried out deductively in EasyCrypt. This allows generality, modularity and composable reasoning, but does not scale well for low-level architecture-specific routines. CryptoLine offers a semi-automatic approach to formally verify algebraically-rich low-level cryptographic routines. CryptoLine proofs are self-contained: they are not integrated into higher-level formal verification developments. This paper shows how to soundly use CryptoLine to discharge subgoals in functional correctness proofs for complex Jasmin programs. We extend Jasmin with annotations and provide an automatic translation into a CryptoLine model, where most complex transformations are certified. We also formalize and implement the automatic extraction of the semantics of a CryptoLine proof to EasyCrypt. Our motivating use-case is the X-Wing hybrid KEM, for which we present the first formally verified implementation.
Institutions: INESC TEC, University of Minho, Universidade do Porto, Max Planck Institute for Security and Privacy, IMDEA Software Institute, Institut national de recherche en sciences et technologies du numérique, Centre Inria d'Université Côte d'Azur, SandboxAQ, PQShield (United Kingdom), National Taiwan University of Science and Technology, Academia Sinica
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
Award: G313061315
OpenAlex ID: W4416549401