13 citations · 27 across the 16 of their papers we have counts for
19 papers
A Minrank-based Encryption Scheme à la Alekhnovich-Regev
Thomas Debris-Alazard, Philippe Gaborit, Romaric Neveu +1
Introduced in 2003 and 2005, Alekhnovich and Regev' schemes were the first public-key encryptions whose security is only based on the average hardness of decoding random linear cod…
MIRANDA: short signatures from a leakage-free full-domain-hash scheme
Alain Couvreur, Thomas Debris-Alazard, Philippe Gaborit +1
We present , the first family of full-domain-hash signatures based on matrix codes. This signature scheme fulfils the paradigm of Gentry, Peikert and Vaikuntanath…
New Solutions to Delsarte's Dual Linear Programs
André Chailloux, Thomas Debris-Alazard
Understanding the maximum size of a code with a given minimum distance is a major question in computer science and discrete mathematics. The most fruitful approach for finding asym…
Quantum Oblivious LWE Sampling and Insecurity of Standard Model Lattice-Based SNARKs
Thomas Debris-Alazard, Pouria Fallahpour, Damien Stehlé
The Learning With Errors () problem asks to find from an input of the form $(\mathbf{A}, \mathbf{b} = \mathbf{A}\mathbf{s}+\mathbf{e}) \in (\mathbb{Z}/q\…
Reduction from sparse LPN to LPN, Dual Attack 3.0
Kévin Carrier, Thomas Debris-Alazard, Charles Meyer-Hilfiger +1
The security of code-based cryptography relies primarily on the hardness of decoding generic linear codes. Until very recently, all the best algorithms for solving the decoding pro…
Code-based Cryptography: Lecture Notes
Thomas Debris-Alazard
These lecture notes have been written for courses given at École normale supérieure de Lyon and summer school 2022 in post-quantum cryptography that took place in the university of…
Statistical Decoding 2.0: Reducing Decoding to LPN
Kevin Carrier, Thomas Debris-Alazard, Charles Meyer-Hilfiger +1
The security of code-based cryptography relies primarily on the hardness of generic decoding with linear codes. The best generic decoding algorithms are all improvements of an old…
Smoothing Codes and Lattices: Systematic Study and New Bounds
Thomas Debris-Alazard, Léo Ducas, Nicolas Resch +1
In this article we revisit smoothing bounds in parallel between lattices codes. Initially introduced by Micciancio and Regev, these bounds were instantiated with Gaussian dis…
On Codes and Learning With Errors over Function Fields
Maxime Bombar, Alain Couvreur, Thomas Debris-Alazard
It is a long standing open problem to find search to decision reductions for structured versions of the decoding problem of linear codes. Such results in the lattice-based setting…
Wavelet: Code-based postquantum signatures with fast verification on microcontrollers
Gustavo Banegas, Thomas Debris-Alazard, Milena Nedeljković +1
This work presents the first full implementation of Wave, a postquantum code-based signature scheme. We define Wavelet, a concrete Wave scheme at the 128-bit classical security lev…
Quantum Reduction of Finding Short Code Vectors to the Decoding Problem
Thomas Debris-Alazard, Maxime Remaud, Jean-Pierre Tillich
We give a quantum reduction from finding short codewords in a random linear code to decoding for the Hamming metric. This is the first time such a reduction (classical or quantum)…
Classical and Quantum algorithms for generic Syndrome Decoding problems and applications to the Lee metric
André Chailloux, Thomas Debris-Alazard, Simona Etinski
The security of code-based cryptography usually relies on the hardness of the syndrome decoding (SD) problem for the Hamming weight. The best generic algorithms are all improvement…
On the hardness of code equivalence problems in rank metric
Alain Couvreur, Thomas Debris-Alazard, Philippe Gaborit
In the recent years, the notion of rank metric in the context of coding theory has known many interesting developments in terms of applications such as space time coding, network c…
Ternary Syndrome Decoding with Large Weight
Rémi Bricout, André Chailloux, Thomas Debris-Alazard +1
The Syndrome Decoding problem is at the core of many code-based cryptosystems. In this paper, we study ternary Syndrome Decoding in large weight. This problem has been introduced i…
Wave: A New Family of Trapdoor One-Way Preimage Sampleable Functions Based on Codes
Thomas Debris-Alazard, Nicolas Sendrier, Jean-Pierre Tillich
We present here a new family of trapdoor one-way Preimage Sampleable Functions (PSF) based on codes, the Wave-PSF family. The trapdoor function is one-way under two computational a…
Two attacks on rank metric code-based schemes: RankSign and an Identity-Based-Encryption scheme
Thomas Debris-Alazard, Jean-Pierre Tillich
RankSign [GRSZ14a] is a code-based signature scheme proposed to the NIST competition for quantum-safe cryptography [AGHRZ17] and, moreover, is a fundamental building block of a new…
A tight security reduction in the quantum random oracle model for code-based signature schemes
André Chailloux, Thomas Debris-Alazard
Quantum secure signature schemes have a lot of attention recently, in particular because of the NIST call to standardize quantum safe cryptography. However, only few signature sche…
The problem with the SURF scheme
Thomas Debris-Alazard, Nicolas Sendrier, Jean-Pierre Tillich
There is a serious problem with one of the assumptions made in the security proof of the SURF scheme. This problem turns out to be easy in the regime of parameters needed for the S…
Statistical Decoding
Thomas Debris-Alazard, Jean-Pierre Tillich
The security of code-based cryptography relies primarily on the hardness of generic decoding with linear codes. The best generic decoding algorithms are all improvements of an old…