Found 6 document(s)
Page 1 of 1
-
We introduce a new family of rank-metric and sum-rank-metric codes called linearized Chinese Remainder Theorem codes (qCRT codes), constructed over linearized polynomial rings via a non-commutative generalization of the ...
-
Fix a prime power q. We prove that deciding whether a received word y in Fnqm lies at rank distance at most n-2 from the one-dimensional Gabidulin code {{λ.g : λ in Fqm } is NP-complete. Thus maximum-likelihood decoding ...
-
In this paper, we present the first single trace side-channel attack that targets the MPC-in-the-Head (MPCitH) framework based on threshold secret sharing, also known as Threshold Computation in the Head (TCitH) in its o...
-
Rank metric code-based cryptography exists for several years. The security of many cryptosystems is based on the difficulty of decoding a random code. Any improvement in the complexity of the best decoding algorithms can...
-
Les attaques algébriques ont marqué la cryptanalyse des registres à décalage avec mémoire. Ce qui est important pour réussir une attaque algébrique, c’est de trouver des équations de degré le plus bas possible dépendants...