Jazzline: Composable CryptoLine Functional Correctness Proofs for Jasmin Programs

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.

Authors

Institutions

Publication Details

Published
2025-11-19
DOI
https://doi.org/10.1145/3719027.3744814
Primary Topic
Cryptographic Implementations and Security
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Jazzline: Composable CryptoLine Functional Correctness Proofs for Jasmin Programs

Lionel Blatter, Bo‐Yin Yang, José Bacelar Almeida, Bow-Yaw Wang et al.
Cryptographic Implementations and Security
article

Jazzline: Composable CryptoLine Functional Correctness Proofs for Jasmin Programs

Lionel Blatter, Bo‐Yin Yang, José Bacelar Almeida, Bow-Yaw Wang, Pierre-Yves Strub, Manuel Barbosa, Gilles Barthe, Tiago Oliveira, Miguel Quaresma, J. L. M. Duarte, Benjamin Grégoire, Ming-Hsien Tsai, Gustavo Delerue
article en

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.

Institut national de recherche en sciences et technologies du numérique (FR), National Taiwan University of Science and Technology (TW), Universidade do Porto (PT), Max Planck Institute for Security and Privacy (DE), Centre Inria d'Université Côte d'Azur (FR), Fondation Sophia Antipolis (FR), INESC TEC (PT), Academia Sinica (TW), University of Minho (PT)
Openalex Percentile: Top 81%
Cryptographic Implementations and Security
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.