Extending Coggia-Couvreur Attack on Loidreau's Rank-metric Cryptosystem

07/14/2020
by   Anirban Ghatak, et al.
0

A recent paper by Coggia and Couvreur presents a polynomial time key-recovery attack on Loidreau's encryption scheme, based on rank-metric codes, for some parameters. The secret matrix component of Loidreau's scheme is chosen over a defining subspace of the field associated with the rank-metric code. We partially extend the Coggia-Couvreur attack to deal with the case when the defining subspace has dimension greater than 2.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/07/2019

On the security of a Loidreau's rank metric code based encryption scheme

We present a polynomial time attack of a rank metric code based encrypti...
research
12/23/2021

An analysis of Coggia-Couvreur attack on Loidreau's rank-metric public key encryption scheme in the general case

In this paper we show that in the case where the public-key can be disti...
research
06/17/2023

A new approach based on quadratic forms to attack the McEliece cryptosystem

We bring in here a novel algebraic approach for attacking the McEliece c...
research
04/07/2018

An attack on a NIST proposal: RankSign, a code-based signature in rank metric

RankSign is a code-based signature scheme proposed to the NIST competiti...
research
09/12/2020

On the security of subspace subcodes of Reed-Solomon codes for public key encryption

This article discusses the security of McEliece-like encryption schemes ...
research
04/06/2021

Two modifications for Loidreau's code-based cryptosystem

This paper presents two modifications for Loidreau's code-based cryptosy...
research
08/17/2019

On the Adversarial Robustness of Subspace Learning

In this paper, we study the adversarial robustness of subspace learning ...

Please sign up or login with your details

Forgot password? Click here to reset