Zobrazeno 1 - 10
of 205
pro vyhledávání: '"Gaborit, Philippe"'
The McEliece scheme is a generic frame which allows to use any error correcting code of which there exists an efficient decoding algorithm to design an encryption scheme by hiding the generator matrix code. Similarly, the Niederreiter frame is the du
Externí odkaz:
http://arxiv.org/abs/2405.16539
In rank-metric cryptography, a vector from a finite dimensional linear space over a finite field is viewed as the linear space spanned by its entries. The rank decoding problem which is the analogue of the problem of decoding a random linear code con
Externí odkaz:
http://arxiv.org/abs/2310.08962
Autor:
Bidoux, Loïc, Chi-Domínguez, Jesús-Javier, Feneuil, Thibauld, Gaborit, Philippe, Joux, Antoine, Rivain, Matthieu, Vinçotte, Adrien
We present a signature scheme based on the Syndrome-Decoding problem in rank metric. It is a construction from multi-party computation (MPC), using a MPC protocol which is a slight improvement of the linearized-polynomial protocol used in [Fen22], al
Externí odkaz:
http://arxiv.org/abs/2307.08726
Autor:
Aragon, Nicolas, Bidoux, Loïc, Chi-Domínguez, Jesús-Javier, Feneuil, Thibauld, Gaborit, Philippe, Neveu, Romaric, Rivain, Matthieu
We exploit the idea of [Fen22] which proposes to build an efficient signature scheme based on a zero-knowledge proof of knowledge of a solution of a MinRank instance. The scheme uses the MPCitH paradigm, which is an efficient way to build ZK proofs.
Externí odkaz:
http://arxiv.org/abs/2307.08575
In this paper we generalize the notion of low-rank parity check (LRPC) codes by introducing a bilinear product over F^m q based on a generic 3-tensor in Fq^mxmxm, where Fq is the finite field with q elements. The generalized LRPC codes are Fq -linear
Externí odkaz:
http://arxiv.org/abs/2305.02053
The Rank Decoding problem (RD) is at the core of rank-based cryptography. This problem can also be seen as a structured version of MinRank, which is ubiquitous in multivariate cryptography. Recently, \cite{BBBGNRT20,BBCGPSTV20} proposed attacks based
Externí odkaz:
http://arxiv.org/abs/2208.05471
We propose two main contributions: first, we revisit the encryption scheme Rank Quasi-Cyclic (RQC) by introducing new efficient variations, in particular, a new class of codes, the Augmented Gabidulin codes; second, we propose new attacks against the
Externí odkaz:
http://arxiv.org/abs/2207.01410
We introduce a new rank-based key encapsulation mechanism (KEM) with public key and ciphertext sizes around 3.5 Kbytes each, for 128 bits of security, without using ideal structures. Such structures allow to compress objects, but give reductions to s
Externí odkaz:
http://arxiv.org/abs/2206.11961
Autor:
Bidoux, Loïc, Gaborit, Philippe
The MPC-in-the-head introduced in [IKOS07] has established itself as an important paradigm to design efficient digital signatures. It has been leveraged in the Picnic scheme [CDG+ 20] that reached the third round of the NIST PQC Standardization proce
Externí odkaz:
http://arxiv.org/abs/2204.02915
In this paper, we study code-based signatures constructed from Proof of Knowledge (PoK). This line of work can be traced back to Stern who introduces the first efficient PoK for the syndrome decoding problem in 1993. Afterward, different variations w
Externí odkaz:
http://arxiv.org/abs/2201.05403