3 papers
cs.IT2025
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…
cs.CR2022
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…
cs.IT2018
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…