3 citations · 5 across the 7 of their papers we have counts for
9 papers
New perspectives for code locality in the rank metric
Camille Garnier, Julien Lavauzelle, Jade Nardi +1
In coding theory, local recovery enables the efficient recovery of some part of (lost) coded data by accessing only a small number of other data entries. Locality was mostly but in…
Constant-time decoding of Gabidulin codes and their generalizations with application to RQC
Nicolas Aragon, Chloé Baïsse, Anthony Fraga +2
Gabidulin codes are a rank metric analog of Reed-Solomon codes. They are of great importance in rank-metric cryptography, as they are employed in highly efficient rank-based scheme…
On the structure of the Schur squares of Twisted Generalized Reed-Solomon codes and application to cryptanalysis
Alain Couvreur, Rakhi Pratihar, Nihan Tanısalı +1
Twisted generalized Reed-Solomon (TGRS) codes constitute an interesting family of evaluation codes, containing a large class of maximum distance separable codes non-equivalent to g…
An extension of Overbeck's attack with an application to cryptanalysis of Twisted Gabidulin-based schemes
Alain Couvreur, Ilaria Zappatore
In this article, we discuss the decoding of Gabidulin and related codes from a cryptographic point of view, and we observe that these codes can be decoded solely from the knowledge…
Polynomial Linear System Solving with Random Errors: new bounds and early termination technique
Guerrini Eleonora, Lebreton Romain, Zappatore Ilaria
This paper deals with the polynomial linear system solving with errors (PLSwE) problem. Specifically, we focus on the evaluation-interpolation technique for solving polynomial line…
Enhancing simultaneous rational function recovery: adaptive error correction capability and new bounds for applications
Eleonora Guerrini, Romain Lebreton, Ilaria Zappatore
In this work we present some results that allow to improve the decoding radius in solving polynomial linear systems with errors in the scenario where errors are additive and random…
On the Uniqueness of Simultaneous Rational Function Reconstruction
Eleonora Guerrini, Romain Lebreton, Ilaria Zappatore
This paper focuses on the problem of reconstructing a vector of rational functions given some evaluations, or more generally given their remainders modulo different polynomials. Th…
Polynomial Linear System Solving with Errors by Simultaneous Polynomial Reconstruction of Interleaved Reed-Solomon Codes
E. Guerrini, R. Lebreton, I. Zappatore
In this paper we present a new algorithm for Polynomial Linear System Solving (via evaluation/interpolation) with errors. In this scenario, errors can occur in the black box evalua…
Wave-Shaped Round Functions and Primitive Groups
Riccardo Aragona, Marco Calderini, Roberto Civino +2
Round functions used as building blocks for iterated block ciphers, both in the case of Substitution-Permutation Networks and Feistel Networks, are often obtained as the compositio…