2 papers
cs.SC2020
On the Complexity of Solving Generic Over-determined Bilinear Systems
John B. Baena, Daniel Cabarcas, Javier Verbel
In this paper, we study the complexity of solving generic over-determined bilinear systems over a finite field . Given a generic bilinear sequence $B \in \mathbb{F}[\ma…
cs.CR2020
Improvements of Algebraic Attacks for solving the Rank Decoding and MinRank problems
Magali Bardet, Maxime Bros, Daniel Cabarcas +5
Rank Decoding (RD) is the main underlying problem in rank-based cryptography. Based on this problem and quasi-cyclic versions of it, very efficient schemes have been proposed recen…