We bring in here a novel algebraic approach for attacking the McEliece
c...
A long standing open question is whether the distinguisher of high rate
...
The Rank Decoding problem (RD) is at the core of rank-based cryptography...
The security of code-based cryptography relies primarily on the hardness...
In this article we revisit smoothing bounds in parallel between lattices...
The Goppa Code Distinguishing (GD) problem asks to distinguish efficient...
We give a quantum reduction from finding short codewords in a random lin...
Decoding a Reed-Solomon code can be modeled by a bilinear system which c...
Rank Decoding (RD) is the main underlying problem in rank-based cryptogr...
The Rank metric decoding problem is the main problem considered in
crypt...
We present here Wave the first 'hash-and-sign' code-based signature sche...
We present a key recovery attack against Y. Wang's Random Linear Code
En...
RankSign is a code-based signature scheme proposed to the NIST competiti...
The key encapsulation mechanism Edon-K was proposed in response to the c...
Moderate Density Parity Check (MDPC) codes are defined here as codes whi...