research
∙
04/28/2023
Polynomial time attack on high rate random alternant codes
A long standing open question is whether the distinguisher of high rate ...
share
research
∙
08/10/2022
Revisiting Algebraic Attacks on MinRank and on the Rank Decoding Problem
The Rank Decoding problem (RD) is at the core of rank-based cryptography...
research
∙
08/02/2022
Improvement of algebraic attacks for solving superdetermined MinRank instances
The MinRank (MR) problem is a computational problem that arises in many ...
research
∙
03/05/2021
An algebraic approach to the Rank Support Learning problem
Rank-metric code-based cryptography relies on the hardness of decoding a...
research
∙
02/04/2021
Decoding Reed-Solomon codes by solving a bilinear system with a Gröbner basis approach
Decoding a Reed-Solomon code can be modeled by a bilinear system which c...
research
∙
02/14/2020
Algebraic attacks for solving the Rank Decoding and MinRank problems without Gröbner basis
Rank Decoding (RD) is the main underlying problem in rank-based cryptogr...
research
∙
10/02/2019
An Algebraic Attack on Rank Metric Code-Based Cryptosystems
The Rank metric decoding problem is the main problem considered in crypt...
research
∙
05/09/2019
Practical Algebraic Attack on DAGS
DAGS scheme is a key encapsulation mechanism (KEM) based on quasi-dyadic...
research
∙
04/30/2019