DeepAI AI Chat
Log In Sign Up

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

by   Anirban Ghatak, et al.

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.


page 1

page 2

page 3

page 4


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...

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...

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...

Polynomial-Time Key Recovery Attack on the Lau-Tan Cryptosystem Based on Gabidulin Codes

This paper presents a key recovery attack on the cryptosystem proposed b...

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

This article discusses the security of McEliece-like encryption schemes ...

Two modifications for Loidreau's code-based cryptosystem

This paper presents two modifications for Loidreau's code-based cryptosy...

On the Adversarial Robustness of Subspace Learning

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