1 citations · 1 across the 5 of their papers we have counts for
6 papers
On the Independence Assumption in Quasi-Cyclic Code-Based Cryptography
Maxime Bombar, Nicolas Resch, Emiel Wiedijk
Cryptography based on the presumed hardness of decoding codes -- i.e., code-based cryptography -- has recently seen increased interest due to its plausible security against quantum…
Correlated Pseudorandomness from the Hardness of Quasi-Abelian Decoding
Maxime Bombar, Geoffroy Couteau, Alain Couvreur +1
Secure computation often benefits from the use of correlated randomness to achieve fast, non-cryptographic online protocols. A recent paradigm put forth by Boyle …
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…
Right-hand side decoding of Gabidulin code and applications
Maxime Bombar, Alain Couvreur
We discuss the decoding of Gabidulin and interleaved Gabidulin codes. We give the full presentation of a decoding algorithm for Gabidulin codes, which as Loidreau's seminal algorit…
Decoding supercodes of Gabidulin codes and applications to cryptanalysis
Maxime Bombar, Alain Couvreur
This article discusses the decoding of Gabidulin codes and shows how to extend the usual decoder to any supercode of a Gabidulin code at the cost of a significant decrease of the d…
Delocalisation of one-dimensional marginals of product measures and the capacity of LTI discrete channels
Maxime Bombar, Alexander Fish
We consider discrete linear time invariant (LTI) channels satisfying the phase independence (PI) assumption. We show that under the PI assumption the capacity of LTI channels is po…