287 citations · 1.1k across the 26 of their papers we have counts for
29 papers
Low Rank Parity Check Codes: New Decoding Algorithms and Applications to Cryptography
Nicolas Aragon, Philippe Gaborit, Adrien Hauteville +2
We introduce a new family of rank metric codes: Low Rank Parity Check codes (LRPC), for which we propose an efficient probabilistic decoding algorithm. This family of codes can be…
Linear-Time Maximum Likelihood Decoding of Surface Codes over the Quantum Erasure Channel
Nicolas Delfosse, Gilles Zémor
Surface codes are among the best candidates to ensure the fault-tolerance of a quantum computer. In order to avoid the accumulation of errors during a computation, it is crucial to…
Efficient Encryption from Random Quasi-Cyclic Codes
Carlos Aguilar, Olivier Blazy, Jean-Christophe Deneuville +2
We propose a framework for constructing efficient code-based encryption schemes from codes that do not hide any structure in their public matrix. The framework is in the spirit of…
Perfectly Secure Message Transmission in Two Rounds
Gabriele Spini, Gilles Zémor
In the model that has become known as "Perfectly Secure Message Transmission"(PSMT), a sender Alice is connected to a receiver Bob through n parallel two-way channels. A computatio…
RankSign: an efficient signature algorithm based on the rank metric
Philippe Gaborit, Olivier Ruatta, Julien Schrek +1
In this paper we propose a new approach to code-based signatures that makes use in particular of rank metric codes. When the classical approach consists in finding the unique preim…
LDA Lattices Without Dithering Achieve Capacity on the Gaussian Channel
Nicola di Pietro, Gilles Zémor, Joseph J. Boutros
This paper deals with Low-Density Construction-A (LDA) lattices, which are obtained via Construction A from non-binary Low-Density Parity-Check codes. More precisely, a proof is pr…